perm filename S85.IN[LET,JMC]1 blob
sn#797493 filedate 1985-06-30 generic text, type C, neo UTF8
COMMENT ⊗ VALID 00566 PAGES
C REC PAGE DESCRIPTION
C00001 00001
C00060 00002 ∂01-Apr-85 0707 AI.WOODY@MCC.ARPA [John McCarthy <JMC@SU-AI.ARPA>: repeat of earlier message ]
C00063 00003 ∂01-Apr-85 0912 EMMA@SU-CSLI.ARPA new mailing list
C00066 00004 ∂01-Apr-85 0936 LAWS@SRI-AI.ARPA [John McCarthy <JMC@SU-AI.ARPA>: Subject: Hofstader on sexist language (from SAIL's BBOARD) ]
C00068 00005 ∂01-Apr-85 0937 ullman@diablo NAIL!
C00069 00006 ∂01-Apr-85 1434 VAL NAIL
C00071 00007 ∂01-Apr-85 1505 YAO@SU-SCORE.ARPA search committee
C00076 00008 ∂02-Apr-85 0041 cheriton@Pescadero Common business communication language
C00078 00009 ∂02-Apr-85 0656 JJW SPIDER
C00079 00010 ∂02-Apr-85 0659 AI.WOODY@MCC.ARPA Re: next visit
C00081 00011 ∂02-Apr-85 0949 NILSSON@SU-SCORE.ARPA CS=>Engrg
C00083 00012 ∂02-Apr-85 1010 GANGOLLI@SU-SCORE.ARPA Bert Enderton
C00085 00013 ∂02-Apr-85 1020 YAO@SU-SCORE.ARPA search committee meeting
C00087 00014 ∂02-Apr-85 1310 RA [Reply to message recvd: 02 Apr 85 00:44-PST]
C00088 00015 ∂02-Apr-85 1329 YAO@SU-SCORE.ARPA [Nils Nilsson <NILSSON@SU-SCORE.ARPA>: candidates]
C00090 00016 ∂02-Apr-85 1415 NILSSON@SU-SCORE.ARPA re: [Nils Nilsson <NILSSON@SU-SCORE.ARPA>: candidates]
C00091 00017 ∂02-Apr-85 1435 PB "cretin"
C00092 00018 ∂02-Apr-85 1657 RA Peat Marwick
C00093 00019 ∂02-Apr-85 2021 BRESNAN@SU-CSLI.ARPA Linguistics Drinks Resume Fridays
C00095 00020 ∂03-Apr-85 0803 FAGAN@SUMEX-AIM.ARPA [Larry Fagan <FAGAN@SUMEX-AIM.ARPA>: Request for Support for AI in Medicine Workshop]
C00100 00021 ∂03-Apr-85 0925 RA CBCL
C00101 00022 ∂03-Apr-85 0932 WALDINGER@SRI-AI.ARPA Re: faculty lunches
C00102 00023 ∂03-Apr-85 0941 SHORTLIFFE@SUMEX-AIM.ARPA re: [Larry Fagan <FAGAN@SUMEX-AIM.ARPA>: Request for Support for AI in Medicine Workshop]
C00104 00024 ∂03-Apr-85 1118 MDD
C00105 00025 ∂03-Apr-85 1218 MDD
C00106 00026 ∂03-Apr-85 1414 RA Cuthbert Hurd
C00107 00027 ∂03-Apr-85 1619 LES Digital Utility Centers
C00130 00028 ∂04-Apr-85 1038 RA Parallel LISP
C00137 00029 ∂04-Apr-85 1135 VARDI@SU-CSLI.ARPA Daniel Lehman
C00139 00030 ∂04-Apr-85 1330 CL.SHANKAR@UTEXAS-20.ARPA Church-Rosser paper
C00146 00031 ∂04-Apr-85 1358 RA leave early
C00147 00032 ∂04-Apr-85 1442 GANGOLLI@SU-SCORE.ARPA Reminder/Bert Enderton
C00151 00033 ∂05-Apr-85 1019 RA income tax return
C00152 00034 ∂05-Apr-85 1337 RA leave early
C00153 00035 ∂05-Apr-85 1401 @SU-CSLI.ARPA:brown@Kestrel Re: Linguistics Drinks Resume Fridays
C00155 00036 ∂05-Apr-85 1500 VAL increase in salary at San Jose State
C00156 00037 ∂05-Apr-85 1715 YAO@SU-SCORE.ARPA
C00157 00038 ∂07-Apr-85 2004 ME NS/AGAIN
C00158 00039 ∂07-Apr-85 2106 ME NS:UNSEEN
C00159 00040 ∂08-Apr-85 0856 GOLUB@SU-SCORE.ARPA Available computer
C00161 00041 ∂08-Apr-85 0928 RA David Chudnovsky
C00162 00042 ∂08-Apr-85 1016 TULEY@SU-SCORE.ARPA message
C00163 00043 ∂08-Apr-85 1026 VAL Circumscription Seminar
C00165 00044 ∂08-Apr-85 1029 VAL Circumscription seminar
C00166 00045 ∂08-Apr-85 1109 ashok@diablo Faculty search folders
C00168 00046 ∂08-Apr-85 1428 VAL Circumscription Seminar
C00169 00047 ∂08-Apr-85 1541 BSCOTT@SU-SCORE.ARPA Research Associate Salaries
C00171 00048 ∂08-Apr-85 1624 avg@diablo coloring I
C00173 00049 ∂08-Apr-85 1624 avg@diablo coloring II
C00176 00050 ∂08-Apr-85 1653 avg@diablo coloring III
C00177 00051 ∂08-Apr-85 1655 RA George Danzig
C00178 00052 ∂08-Apr-85 1655 avg@diablo coloring IV
C00182 00053 ∂08-Apr-85 1700 avg@diablo coloring V
C00183 00054 Now I remember that the text last Fall time was issued in two installments.
C00185 00055 ∂08-Apr-85 1736 avg@diablo coloring V-a
C00187 00056 ∂08-Apr-85 1737 avg@diablo coloring VI
C00192 00057 ∂08-Apr-85 1746 JOHN@SU-CSLI.ARPA Meeting
C00194 00058 ∂08-Apr-85 1920 avg@diablo re: Self-Modifying Code Survey (from SAIL's BBOARD)
C00195 00059 ∂08-Apr-85 2021 VGA avoiding space problems in prolog
C00196 00060 ∂09-Apr-85 0826 RA Re: Lisp programming and proving.
C00197 00061 ∂09-Apr-85 0827 RA wrong message
C00198 00062 ∂09-Apr-85 0900 JMC*
C00199 00063 ∂09-Apr-85 y48 RA AI book
C00200 00064 ∂09-Apr-85 1214 RA go out
C00201 00065 ∂09-Apr-85 1228 avg@diablo Re: doubt
C00203 00066 ∂09-Apr-85 1253 LAURENCE@SU-CSLI.ARPA re: Self-Modifying Code Survey (from SAIL's BBOARD)
C00205 00067 ∂09-Apr-85 1254 LAURENCE@SU-CSLI.ARPA re: Self-Modifying Code Survey (from SAIL's BBOARD)
C00206 00068 ∂09-Apr-85 1338 RA interview
C00207 00069 ∂09-Apr-85 1604 PETERS@SU-CSLI.ARPA Thanks
C00208 00070 ∂09-Apr-85 1604 YAO@SU-SCORE.ARPA search committee meeting
C00210 00071 ∂09-Apr-85 1607 YAO@SU-SCORE.ARPA re:previous message
C00211 00072 ∂09-Apr-85 1704 RA Yoram Moses orals
C00212 00073 ∂09-Apr-85 1728 @SU-CSLI.ARPA:CLT@SU-AI.ARPA Seminar in Logic and Foundations of Mathematics
C00215 00074 ∂09-Apr-85 1811 RESTIVO@SU-SCORE.ARPA re: Self-Modifying Code Survey (from SAIL's BBOARD)
C00216 00075 ∂09-Apr-85 1856 MRC@SU-SCORE.ARPA self-modifying
C00218 00076 ∂09-Apr-85 2032 VGA Prolog magic
C00220 00077 ∂09-Apr-85 2121 EM@SU-SCORE.ARPA Lisp programming and proving.
C00221 00078 ∂10-Apr-85 0053 REGES@SU-SCORE.ARPA SUSHI
C00222 00079 ∂10-Apr-85 1436 @SU-SCORE.ARPA:bellcore!walker@Berkeley invitation to an AI Conference in Singapore
C00227 00080 ∂10-Apr-85 1620 VARDI@SU-CSLI.ARPA [djl%brandeis.csnet@csnet-relay.arpa: Re: Interests]
C00233 00081 ∂10-Apr-85 1947 CLT ira etc.
C00234 00082 ∂11-Apr-85 0956 joanna@Krakatoa Discussions with Peter Will and Mark Raibert
C00239 00083 ∂11-Apr-85 1115 GOLUB@SU-SCORE.ARPA [Gene Golub <GOLUB@SU-SCORE.ARPA>: Available computer]
C00241 00084 ∂11-Apr-85 1150 RA Monday date
C00242 00085 ∂11-Apr-85 1403 SJG lunch with my mom?
C00243 00086 ∂11-Apr-85 1436 SJG mom's visit
C00244 00087 ∂11-Apr-85 1455 VARDI@SU-CSLI.ARPA
C00245 00088 ∂12-Apr-85 0928 RA Stanford AI specific projects
C00246 00089 ∂12-Apr-85 1005 Bobrow.pa@Xerox.ARPA Re: Copyright Permission
C00248 00090 ∂12-Apr-85 1359 berglund@Pescadero Max Hailperin
C00249 00091 ∂12-Apr-85 1709 RA Symposium on AI at XEROX
C00250 00092 ∂13-Apr-85 1051 GANGOLLI@SU-SCORE.ARPA Tom Strat
C00251 00093 ∂14-Apr-85 1915 CL.BOYER@UTEXAS-20.ARPA
C00253 00094 ∂14-Apr-85 2038 CL.BOYER@UTEXAS-20.ARPA [Yoni Malachi <YM@SU-AI.ARPA>: Lisp conferences proceedings ]
C00255 00095 ∂15-Apr-85 0939 berglund@Pescadero Hailperin
C00256 00096 ∂15-Apr-85 1020 CLT reminder
C00257 00097 ∂15-Apr-85 1040 RA Hypercube meeting
C00258 00098 ∂15-Apr-85 1043 VAL prioritized circumscription
C00259 00099 ∂15-Apr-85 1118 berglund@Pescadero re: Hailperin
C00260 00100 ∂15-Apr-85 1454 RA Ross Overbeek
C00261 00101 ∂16-Apr-85 0800 JMC*
C00262 00102 ∂16-Apr-85 0809 AI.WOODY@MCC.ARPA
C00263 00103 ∂16-Apr-85 1008 CL.BOYER@UTEXAS-20.ARPA [ATP.SCHELTER: Macsyma for the Explorer]
C00266 00104 ∂16-Apr-85 1021 VAL Circumscription Seminar
C00267 00105 ∂16-Apr-85 1030 CL.BOYER@UTEXAS-20.ARPA [ATP.SCHELTER: Macsyma for the Explorer]
C00268 00106 ∂16-Apr-85 1648 TULEY@SU-SCORE.ARPA message
C00269 00107 ∂17-Apr-85 0700 JMC*
C00270 00108 ∂17-Apr-85 1003 NILSSON@SU-SCORE.ARPA Re: SRI report request net address?
C00272 00109 ∂17-Apr-85 1547 JOHN@SU-CSLI.ARPA Budget for Summer 1985
C00274 00110 ∂17-Apr-85 1552 LIBRARY@SU-SCORE.ARPA Socrates
C00276 00111 ∂17-Apr-85 1602 RA MAD
C00277 00112 ∂18-Apr-85 0900 ASUBRAMANIAN@SUMEX-AIM.ARPA My real netmail address
C00278 00113 ∂18-Apr-85 0927 AAAI-OFFICE@SUMEX-AIM.ARPA AAAI Nominations
C00280 00114 ∂18-Apr-85 1045 RA David Chudnovsky
C00281 00115 ∂18-Apr-85 1150 TREITEL@SUMEX-AIM.ARPA re: Knowledge as an obstacle (from SAIL's BBOARD)
C00283 00116 ∂18-Apr-85 1401 RA leave early
C00284 00117 ∂18-Apr-85 1428 perlis@gymble paper
C00289 00118 ∂19-Apr-85 0858 RA vacation
C00290 00119 ∂19-Apr-85 0922 CLT
C00291 00120 ∂19-Apr-85 0938 overbeek@anl-mcs a brief comment
C00296 00121 ∂19-Apr-85 1020 RA Will Kessler
C00297 00122 ∂19-Apr-85 1027 VAL
C00298 00123 ∂19-Apr-85 1037 avg@diablo re: No More Joe Bob!!
C00301 00124 ∂19-Apr-85 1214 RA Re: vacation
C00302 00125 ∂19-Apr-85 1214 RA lunch
C00303 00126 ∂19-Apr-85 1251 CLT
C00304 00127 ∂19-Apr-85 1410 VAL
C00305 00128 ∂19-Apr-85 1528 BSCOTT@SU-SCORE.ARPA ARPA Contracts (McCarthy ARPA Umbrella
C00309 00129 ∂19-Apr-85 1547 VAL Circumscription seminar
C00310 00130 ∂19-Apr-85 1620 fateman%ucbdali@Berkeley Qlisp
C00311 00131 ∂20-Apr-85 1000 JMC*
C00312 00132 ∂21-Apr-85 1251 BAMPI@SU-SIERRA.ARPA JMC reads Ortega
C00315 00133 ∂21-Apr-85 1408 RPG Program versus data memory
C00318 00134 ∂22-Apr-85 0927 SQUIRES@USC-ISI.ARPA Re: uniform access to memory
C00321 00135 ∂22-Apr-85 0954 HEDGES@SU-SCORE.ARPA Robotics Search Meeting with Zucker
C00322 00136 ∂22-Apr-85 1153 RA Your daughter Suzan
C00323 00137 ∂22-Apr-85 1249 MOGUL@SU-SCORE.ARPA Who is lying about Nicaragua?
C00326 00138 ∂22-Apr-85 1450 BAMPI@SU-SIERRA.ARPA re: Who is lying about Nicaragua?
C00329 00139 ∂22-Apr-85 1507 MOGUL@SU-SCORE.ARPA re: Who is lying about Nicaragua?
C00336 00140 ∂22-Apr-85 2147 JOCK@SU-SCORE.ARPA LABREA
C00337 00141 ∂22-Apr-85 2226 GROSOF@SU-SCORE.ARPA notes on your draft
C00340 00142 ∂23-Apr-85 0900 JMC*
C00341 00143 ∂23-Apr-85 0934 HANRAHAN@SU-SCORE.ARPA
C00342 00144 ∂23-Apr-85 1014 CLT
C00343 00145 ∂23-Apr-85 1208 RA lunch
C00344 00146 ∂23-Apr-85 1302 LES Blasgen contact
C00345 00147 ∂23-Apr-85 1315 JJW SAIL disk usage
C00347 00148 ∂23-Apr-85 1456 JOCK@SU-SCORE.ARPA re: LABREA
C00348 00149 ∂23-Apr-85 1709 JJW Re: SAIL disk usage
C00349 00150 ∂23-Apr-85 2205 GARDNER@SUMEX-AIM.ARPA Your presidential address in Austin
C00351 00151 ∂24-Apr-85 0848 ASHOK@SU-SUSHI.ARPA Re: Uday Reddy
C00352 00152 ∂24-Apr-85 0958 berglund@Pescadero Max Hailperin
C00353 00153 ∂24-Apr-85 1121 SJG circumscription article
C00357 00154 ∂24-Apr-85 1203 CLT
C00358 00155 ∂24-Apr-85 1230 RA David Chudnovsky
C00360 00156 ∂24-Apr-85 1419 @MIT-MC:MINSKY@MIT-OZ
C00362 00157 ∂24-Apr-85 1516 @STONY-BROOK.SCRC.Symbolics.COM:rwg@RUSSIAN.SPA.Symbolics.COM melzak
C00364 00158 ∂24-Apr-85 1528 ASHOK@SU-SUSHI.ARPA [John McCarthy <JMC@SU-AI.ARPA>: re: Uday Reddy ]
C00368 00159 ∂24-Apr-85 1654 AAAI-OFFICE@SUMEX-AIM.ARPA Nominations
C00369 00160 ∂25-Apr-85 0900 JMC*
C00370 00161 ∂25-Apr-85 0917 HEDGES@SU-SCORE.ARPA CS224 Artificial Intelligence Seminar
C00372 00162 ∂25-Apr-85 0954 BARWISE@SU-CSLI.ARPA Fulbright Scholar Program
C00373 00163 ∂25-Apr-85 1004 @SU-CSLI.ARPA:CLT@SU-AI.ARPA Seminar in Logic and Foundations of Mathematics
C00375 00164 ∂25-Apr-85 1046 ASHOK@SU-SUSHI.ARPA Re: Uday Reddy
C00377 00165 ∂25-Apr-85 1046 ASHOK@SU-SUSHI.ARPA Faculty candidate
C00378 00166 ∂25-Apr-85 1141 VAL re: Applications of circumscription paper
C00379 00167 ∂25-Apr-85 1156 kessler%utah-orion@utah-cs Cray PSL and Bignums
C00381 00168 ∂25-Apr-85 1200 AAAI-OFFICE@SUMEX-AIM.ARPA Conference Proposals
C00385 00169 ∂25-Apr-85 1202 VAL Circumscription Seminar
C00386 00170 ∂25-Apr-85 1227 JMC
C00387 00171 ∂25-Apr-85 1247 GENESERETH@SUMEX-AIM.ARPA my time
C00388 00172 ∂25-Apr-85 1312 U-REDDY@UTAH-20.ARPA Re: Your visit to Stanford
C00390 00173 ∂25-Apr-85 1311 RA PC Magazine
C00391 00174 ∂25-Apr-85 1337 RA Message for David Chudnovsky
C00392 00175 ∂25-Apr-85 1343 ME military type
C00393 00176 ∂25-Apr-85 1349 RA leave early
C00394 00177 ∂25-Apr-85 1658 BRONSTEIN@SU-SCORE.ARPA "Terrorist" or "Rebel" ?
C00397 00178 ∂26-Apr-85 0445 HST zehe eyc.
C00398 00179 ∂26-Apr-85 0900 JMC*
C00399 00180 ∂26-Apr-85 1142 ASHOK@SU-SUSHI.ARPA Faculty candidate's visit postponed
C00400 00181 ∂26-Apr-85 1252 SHORTLIFFE@SUMEX-AIM.ARPA Re: Conference Proposals
C00402 00182 ∂26-Apr-85 1332 YAO@SU-SCORE.ARPA interview
C00404 00183 ∂26-Apr-85 1343 CLT
C00405 00184 ∂26-Apr-85 1457 VAL
C00406 00185 ∂26-Apr-85 1516 YOM Ph.D. Orals
C00410 00186 ∂26-Apr-85 1558 LES
C00412 00187 ∂26-Apr-85 1623 NILSSON@SU-SCORE.ARPA Re: interview
C00414 00188 ∂26-Apr-85 1638 VAL Full-time Appointment
C00416 00189 ∂26-Apr-85 1738 PALLAS@SU-SCORE.ARPA re: Sit in outside of Kennedy's office (from SAIL's BBOARD)
C00419 00190 ∂26-Apr-85 2034 LAMPING@SU-SCORE.ARPA Re: Steve Zucher
C00424 00191 ∂26-Apr-85 2056 RESTIVO@SU-SCORE.ARPA normal form for monadic formulas
C00425 00192 ∂26-Apr-85 2244 POSER@SU-CSLI.ARPA re: Sit in outside of Kennedy's office (from SAIL's BBOARD)
C00427 00193 ∂27-Apr-85 1303 CLT
C00428 00194 ∂27-Apr-85 1348 CLT
C00429 00195 ∂28-Apr-85 1517 EDWARDS@SRI-AI.ARPA Cambodia, Vietnam, and Political Discussion
C00432 00196 ∂28-Apr-85 1733 @RUTGERS.ARPA:MAILER-DAEMON@lbl-csam Returned mail: Host unknown
C00434 00197 ∂29-Apr-85 0722 @MIT-MC:RICH@MIT-OZ Conference Proposals
C00437 00198 ∂29-Apr-85 0826 TULEY@SU-SCORE.ARPA telecommunication
C00438 00199 ∂29-Apr-85 0850 SHORTLIFFE@SUMEX-AIM.ARPA Re: Conference Proposals
C00441 00200 ∂29-Apr-85 0850 EDWARDS@SRI-AI.ARPA re: Cambodia, Vietnam, and Political Discussion
C00443 00201 ∂29-Apr-85 0905 Stefik.pa@Xerox.ARPA Re: Conference Proposals
C00445 00202 ∂29-Apr-85 0911 HEDGES@SU-SCORE.ARPA S. Zucker
C00451 00203 ∂29-Apr-85 0917 RA telex
C00452 00204 ∂29-Apr-85 1006 RA Ray Caron
C00453 00205 ∂29-Apr-85 1032 TULEY@SU-SCORE.ARPA message
C00454 00206 ∂29-Apr-85 1106 LES
C00457 00207 ∂29-Apr-85 1201 RA David Brock
C00458 00208 ∂29-Apr-85 1222 RA brachm.re1
C00460 00209 ∂29-Apr-85 1244 RPG Flexible
C00461 00210 ∂29-Apr-85 1250 CLT reply to reply to message
C00462 00211 ∂29-Apr-85 1323 JMM The Swiss Approach- Applied consistently
C00463 00212 ∂29-Apr-85 1424 RA Ray Reiter
C00464 00213 ∂29-Apr-85 1446 RA Carolyn Davidson
C00465 00214 ∂29-Apr-85 1522 RA leave early
C00466 00215 ∂29-Apr-85 1546 AMAREL@RUTGERS.ARPA Re: Conference Proposals
C00471 00216 ∂29-Apr-85 1616 ullman@diablo Parallel Computing Center
C00474 00217 ∂29-Apr-85 1613 RTC Lisp Machines
C00475 00218 ∂29-Apr-85 1933 LES Lifschitz review
C00476 00219 ∂30-Apr-85 0843 @MIT-MC:RICH@MIT-OZ Conference Proposals
C00479 00220 ∂30-Apr-85 1142 KONOLIGE@SRI-AI.ARPA equality
C00482 00221 ∂30-Apr-85 1233 RA AI training
C00483 00222 ∂30-Apr-85 1400 JMC
C00484 00223 ∂30-Apr-85 1916 YOM
C00485 00224 ∂01-May-85 1119 LIBRARY@SU-SCORE.ARPA SOCRATES conversion of Math/CS Library
C00487 00225 ∂01-May-85 1143 RA Carolyn Davidson called again
C00488 00226 ∂01-May-85 1206 RA brachm.re1
C00489 00227 ∂01-May-85 1244 RA out for lunch
C00490 00228 ∂01-May-85 1520 ME NS wires up
C00491 00229 ∂01-May-85 2038 ullman@diablo TR-903
C00492 00230 ∂02-May-85 0247 REGES@SU-SUSHI.ARPA Your SUSHI account
C00493 00231 ∂02-May-85 0900 JMC
C00494 00232 ∂02-May-85 1008 RA reminder
C00495 00233 ∂02-May-85 1031 RA talk
C00496 00234 ∂02-May-85 1042 RA Cuthbert Hurd
C00497 00235 ∂02-May-85 1107 RA Sagem, France
C00498 00236 ∂02-May-85 1300 JMC
C00499 00237 ∂02-May-85 1403 RA class
C00500 00238 ∂02-May-85 1610 CL.SHANKAR@UTEXAS-20.ARPA Waiting to hear from Stanford
C00501 00239 ∂02-May-85 1718 CHASK@SU-SIERRA.ARPA asking advice on materials.
C00502 00240 ∂02-May-85 2027 CHASK@SU-SIERRA.ARPA re: asking advice on materials.
C00503 00241 ∂02-May-85 2334 HST lisp-museum
C00504 00242 ∂03-May-85 1032 CLT
C00505 00243 ∂03-May-85 1309 JMC
C00506 00244 ∂03-May-85 1649 VAL Circumscription seminar
C00507 00245 ∂04-May-85 1035 CLT
C00508 00246 ∂04-May-85 1304 MRC@SU-SCORE.ARPA Communism
C00512 00247 ∂04-May-85 1337 TREITEL@SU-SUSHI.ARPA re: Gay Blue Jeans Day--Monday, May 6 (from SAIL's BBOARD)
C00514 00248 ∂05-May-85 1806 ucscc!beeson%ucscd.ucscc.UUCP@Berkeley I'll be at Stanford 1-86 to 6-86
C00516 00249 ∂05-May-85 1806 ucscc!beeson%ucscd.ucscc.UUCP@Berkeley comment on my work?
C00519 00250 ∂06-May-85 0211 HST lisp museum
C00520 00251 ∂06-May-85 0900 JMC
C00521 00252 ∂06-May-85 0904 RG.JHM@Lindy
C00523 00253 ∂06-May-85 0919 HEDGES@SU-SCORE.ARPA Robotics Search Committee
C00524 00254 ∂06-May-85 0935 ASHOK@SU-SUSHI.ARPA N.Shankar
C00525 00255 ∂06-May-85 1025 JJW Multilisp
C00527 00256 ∂06-May-85 1347 RG.JHM@Lindy
C00528 00257 ∂06-May-85 1536 RA brachm.re1
C00529 00258 ∂06-May-85 1718 DAVIES@SUMEX-AIM.ARPA Wednesday meeting -- 9 am
C00530 00259 ∂06-May-85 1802 CL.BOYER@UTEXAS-20.ARPA bibliography
C00531 00260 ∂06-May-85 2206 ullman@diablo next meeting
C00532 00261 ∂07-May-85 1111 JMC
C00533 00262 ∂07-May-85 1111 JMC
C00534 00263 ∂07-May-85 1125 VAL modularization of circumscription
C00535 00264 ∂07-May-85 1143 RA Prof. Wu
C00536 00265 ∂07-May-85 1328 RA Joseph Goguen
C00537 00266 ∂07-May-85 1337 CLT
C00538 00267 ∂07-May-85 1916 GSF Common-Sense Summer
C00539 00268 ∂08-May-85 0150 NORMAN@SRI-AI.ARPA Files archived from directory <PS:<COMMONSENSE>>
C00540 00269 ∂08-May-85 0622 YAO@SU-SCORE.ARPA Re: Scherlis
C00541 00270 ∂08-May-85 0928 GANGOLLI@SU-SCORE.ARPA late visitor
C00542 00271 ∂08-May-85 1032 VAL paper on applications of circ'n
C00543 00272 ∂08-May-85 1154 RA lunch
C00544 00273 ∂08-May-85 1548 RA Electronics Week Magazine
C00545 00274 ∂08-May-85 1632 DAVIES@SUMEX-AIM.ARPA AAP@SUMEX Mailing List
C00547 00275 ∂08-May-85 1741 JF@SU-SUSHI.ARPA milk
C00548 00276 ∂08-May-85 1831 DAVIES@SUMEX-AIM.ARPA AAP meeting
C00550 00277 ∂09-May-85 0905 RA [Reply to message recvd: 09 May 85 00:48 Pacific Time]
C00551 00278 ∂09-May-85 0922 ASHOK@SU-SUSHI.ARPA N. Shankar's visit
C00552 00279 ∂09-May-85 0935 ASHOK@SU-SUSHI.ARPA Re: N. Shankar's visit
C00555 00280 ∂09-May-85 1034 NILSSON@SU-SCORE.ARPA Liskov
C00556 00281 ∂09-May-85 1109 JF@SU-SUSHI.ARPA milk
C00557 00282 ∂09-May-85 1300 thh@diablo Elod Knuth
C00559 00283 ∂09-May-85 1418 RA leave early
C00560 00284 ∂09-May-85 1814 GSF Thanks
C00561 00285 ∂09-May-85 1852 ASHOK@SU-SUSHI.ARPA [CL.SHANKAR@UTEXAS-20.ARPA: Re: Schedule, May 13, Monday]
C00564 00286 ∂10-May-85 0851 M.SUSAN@SU-SIERRA.ARPA [Bernard←Galler%UMich-MTS.Mailnet@MIT-MULTICS.ARPA:]
C00567 00287 ∂10-May-85 1012 VAL moving blocks
C00568 00288 ∂10-May-85 1020 GANGOLLI@SU-SCORE.ARPA [Anil Gangolli <GANGOLLI@SU-SCORE.ARPA>: late visitor]
C00570 00289 ∂10-May-85 1115 CLT
C00571 00290 ∂10-May-85 1607 LES Signature
C00572 00291 ∂10-May-85 1734 PARK@SRI-AI.ARPA AUSSIE PARTY!!!
C00584 00292 ∂11-May-85 1509 CLT
C00585 00293 ∂12-May-85 1031 GENESERETH@SUMEX-AIM.ARPA ai qual
C00588 00294 ∂12-May-85 1748 NILSSON@SU-SCORE.ARPA Re: ai qual
C00590 00295 ∂13-May-85 0930 BACH@SU-SCORE.ARPA re: Chile and non-obnoxious communist governments (from SAIL's BBOARD)
C00592 00296 ∂13-May-85 1113 RA [Reply to message recvd: 12 May 85 19:20 Pacific Time]
C00593 00297 ∂13-May-85 1424 VAL seminar
C00594 00298 ∂13-May-85 1729 CLT
C00595 00299 ∂13-May-85 1822 ME delayed mail
C00597 00300 ∂14-May-85 0716 JOHN@SU-CSLI.ARPA Re: selling time
C00598 00301 ∂14-May-85 0915 LINDSTROM@UTAH-20.ARPA Re: visit
C00603 00302 ∂14-May-85 0956 CLT spelling
C00604 00303 ∂14-May-85 1012 CL.BOYER@UTEXAS-20.ARPA
C00606 00304 ∂14-May-85 1136 YM Lindstrom
C00608 00305 ∂14-May-85 1223 JMC
C00609 00306 ∂14-May-85 1420 SMC Bledsoe called just after you left, postponing is fine, but he will
C00610 00307 ∂14-May-85 1807 RA David Chudnovsky
C00611 00308 ∂14-May-85 2013 RA tickets
C00612 00309 ∂15-May-85 1254 ullman@diablo C.R.A.P.
C00613 00310 ∂15-May-85 1306 RA time off
C00614 00311 ∂15-May-85 1310 YAO@SU-SCORE.ARPA Lloyd
C00615 00312 ∂15-May-85 1348 CLT
C00616 00313 ∂15-May-85 1429 LES CSD file backup system
C00617 00314 ∂15-May-85 1623 ARIADNE@SU-SCORE.ARPA tel msg.
C00618 00315 ∂15-May-85 1907 bktotty%mit-teela@mit-athena.ARPA The mysterious message
C00620 00316 ∂15-May-85 1915 JJW Random from MIT
C00622 00317 ∂15-May-85 2158 PATTIS@WASHINGTON.ARPA Bruce Franklin & Death
C00624 00318 ∂15-May-85 2257 PATTIS@WASHINGTON.ARPA re: Bruce Franklin & Death
C00626 00319 ∂15-May-85 2314 cheriton@Pescadero Re: CSD file backup system
C00630 00320 ∂16-May-86 0800 JMC
C00631 00321 ∂16-May-86 0800 JMC
C00632 00322 ∂16-May-86 0800 JMC
C00633 00323 ∂16-May-86 0800 JMC
C00634 00324 ∂16-May-86 1023 CLT computer
C00635 00325 ∂16-May-85 1902 MOGUL@SU-SCORE.ARPA Re: "The action may be punitive".
C00639 00326 ∂16-May-85 1903 GOLDBERG@SU-CSLI.ARPA
C00641 00327 ∂16-May-85 1918 HANRAHAN@SU-SCORE.ARPA message
C00642 00328 ∂17-May-85 0944 cheriton@Pescadero Multiprocessor project
C00643 00329 ∂17-May-85 0948 VAL situation calculus
C00645 00330 ∂17-May-85 1024 RA message for Prof. McCarthy
C00646 00331 ∂17-May-85 1006 VAL Circumscription seminar
C00647 00332 ∂17-May-85 1102 fateman%ucbdali@Berkeley a better parallel machine
C00649 00333 ∂17-May-85 1231 CLT supper
C00650 00334 ∂17-May-85 1406 HEDGES@SU-SCORE.ARPA Peter Will
C00652 00335 ∂17-May-85 1412 VAL working schedule
C00653 00336 ∂17-May-85 1512 LIBRARY@SU-SCORE.ARPA Socrates conversion of Math/CS Library material
C00655 00337 ∂17-May-85 1518 RA check
C00656 00338 ∂17-May-85 1653 BETSY@SU-CSLI.ARPA CSLI Project Proposals
C00658 00339 ∂17-May-85 1706 GOLDBERG@SU-CSLI.ARPA Re: reply to message
C00662 00340 ∂17-May-85 1709 MOGUL@SU-SCORE.ARPA re: "The action may be punitive".
C00666 00341 ∂18-May-85 1257 CLT
C00667 00342 ∂18-May-85 2100 LES
C00668 00343 ∂20-May-85 0836 LINDSTROM@UTAH-20.ARPA visit
C00669 00344 ∂20-May-85 0948 RA VTSS
C00670 00345 ∂20-May-85 1141 LES Qlisp
C00673 00346 ∂20-May-85 1313 CL.BOYER@UTEXAS-20.ARPA review
C00691 00347 ∂20-May-85 1400 RA AAAS
C00692 00348 ∂20-May-85 1422 GENESERETH@SUMEX-AIM.ARPA qual schedule
C00694 00349 ∂20-May-85 1439 RA Bert Raphael
C00695 00350 ∂20-May-85 1503 RA symbolics
C00696 00351 ∂20-May-85 1506 FEIGENBAUM@SUMEX-AIM.ARPA Re: qual schedule
C00697 00352 ∂20-May-85 1538 EC.CAT@Lindy Please send Socrates Update to
C00698 00353 ∂20-May-85 1635 NILSSON@SU-SCORE.ARPA Re: qual schedule
C00699 00354 ∂20-May-85 1720 FEIGENBAUM@SUMEX-AIM.ARPA NASA workshop in September
C00702 00355 ∂21-May-85 0900 JMC
C00703 00356 ∂21-May-85 0900 JMC
C00704 00357 ∂21-May-85 0926 RA presentation by Flexible Computer Corp.
C00705 00358 ∂21-May-85 1033 CLT dumps a SAIL
C00706 00359 ∂21-May-85 1039 RA David Chudnovsky
C00707 00360 ∂21-May-85 1032 VAL frame problem
C00709 00361 ∂21-May-85 1127 RA trips
C00710 00362 ∂21-May-85 1229 RA [Reply to message recvd: 20 May 85 20:53 Pacific Time]
C00711 00363 ∂21-May-85 1408 SQUIRES@USC-ISI.ARPA Re: Qlisp
C00712 00364 ∂21-May-85 1627 RA united parcel service
C00713 00365 ∂21-May-85 2123 yorick%nmsu.csnet@csnet-relay.arpa
C00716 00366 ∂21-May-85 2124 yorick%nmsu.csnet@csnet-relay.arpa
C00717 00367 ∂22-May-85 0933 RA Wants to meet with you
C00718 00368 ∂22-May-85 0939 SJG number theory
C00719 00369 ∂22-May-85 0954 RA Cuthbert Hurd
C00720 00370 ∂22-May-85 1003 VAL re: frame problem
C00722 00371 ∂22-May-85 1054 DOYLE@CMU-CS-C.ARPA recommendation
C00724 00372 ∂22-May-85 1407 ASHOK@SU-SUSHI.ARPA [Andrew Yao <YAO@SU-SCORE.ARPA>: interview candidate]
C00727 00373 ∂22-May-85 1615 PIERCE@SU-SCORE.ARPA Secretarial Assistance
C00728 00374 ∂22-May-85 1945 CLT
C00729 00375 ∂22-May-85 2105 ASHOK@SU-SUSHI.ARPA [C. Papadimitriou <PAPA@SU-SCORE.ARPA>: Re: interview candidate]
C00731 00376 ∂22-May-85 2108 ASHOK@SU-SUSHI.ARPA Re: interview candidate
C00734 00377 ∂22-May-85 2137 JJW Summer plans
C00735 00378 ∂22-May-85 2146 ASHOK@SU-SUSHI.ARPA re: interview candidate
C00736 00379 ∂23-May-85 0754 DOYLE@CMU-CS-C.ARPA re: recommendation
C00737 00380 ∂23-May-85 0801 JK ekl
C00738 00381 ∂23-May-85 1000 JMC
C00739 00382 ∂23-May-85 1023 PIERCE@SU-SCORE.ARPA Secretarial Assistance
C00741 00383 ∂23-May-85 1116 avg@diablo re: International Debate (from SAIL's BBOARD)
C00742 00384 ∂23-May-85 1132 BSCOTT@SU-SCORE.ARPA Qlisp . . . Proposal to ARPA
C00744 00385 ∂23-May-85 1149 YAO@SU-SCORE.ARPA [Andrew Yao <YAO@SU-SCORE.ARPA>: interview candidate]
C00747 00386 ∂23-May-85 1247 TREITEL@SU-SUSHI.ARPA re: International Debate (from SAIL's BBOARD)
C00750 00387 ∂23-May-85 1300 JMC
C00751 00388 ∂23-May-85 1330 TULEY@SU-SCORE.ARPA message
C00753 00389 ∂23-May-85 1432 TULEY@SU-SCORE.ARPA Tech Board
C00754 00390 ∂23-May-85 1651 DAVIES@SU-CSLI.ARPA re: International Debate (from SAIL's BBOARD)
C00756 00391 ∂24-May-85 1110 OHLANDER@USC-ISI.ARPA Funding for Common Lisp and Benchmarking
C00759 00392 ∂24-May-85 1112 BSCOTT@SU-SCORE.ARPA
C00760 00393 ∂24-May-85 1145 BSCOTT@SU-SCORE.ARPA Re: Sarah
C00761 00394 ∂24-May-85 1157 TULEY@SU-SCORE.ARPA Robotics Search Committee Meeting
C00762 00395 ∂24-May-85 1440 AI.WOODY@MCC.ARPA Re: yet another postponement
C00764 00396 ∂24-May-85 1508 NILSSON@SU-SCORE.ARPA AI "Retreat"
C00767 00397 ∂24-May-85 1651 JMM Faculty Search suggestion
C00769 00398 ∂24-May-85 1847 VAL situation calculus
C00770 00399 ∂25-May-85 1454 POURNE@MIT-MC Pournelle's story
C00771 00400 ∂25-May-85 1511 POURNE@MIT-MC urgent change
C00772 00401 ∂25-May-85 1518 CLT
C00773 00402 ∂25-May-85 1519 CLT oops
C00774 00403 ∂25-May-85 1531 POURNE@MIT-MC urgent change
C00775 00404 ∂26-May-85 1457 CLT calendar item
C00776 00405 ∂26-May-85 1642 GENESERETH@SUMEX-AIM.ARPA qual schedule
C00778 00406 ∂26-May-85 2057 ucscc!beeson%ucscd.ucscc.UUCP@Berkeley Lifschitz's comments on my paper and my reply
C00788 00407 ∂28-May-85 0511 OHLANDER@USC-ISI.ARPA re: Funding for Common Lisp and Benchmarking
C00790 00408 ∂28-May-85 0712 CL.BOYER@UTEXAS-20.ARPA
C00791 00409 ∂28-May-85 0905 NILSSON@SU-SCORE.ARPA Duda
C00792 00410 ∂28-May-85 1113 BOSACK@SU-SCORE.ARPA Re: xgp
C00794 00411 ∂28-May-85 1508 AAAI-OFFICE@SUMEX-AIM.ARPA Computer in Mathematics Conference
C00796 00412 ∂28-May-85 1551 AI.WOODY@MCC.ARPA Re: Computer in Mathematics Conference
C00797 00413 ∂28-May-85 1606 MOGUL@SU-SCORE.ARPA re: "The action may be punitive".
C00800 00414 ∂29-May-85 1252 vardi@diablo Daniel Lehman
C00801 00415 ∂29-May-85 1310 HEDGES@SU-SCORE.ARPA Japan Trip
C00804 00416 ∂29-May-85 1335 udi%wisdom.bitnet@WISCVM.ARPA Re: Your letter of April 10
C00806 00417 ∂29-May-85 1459 YAO@SU-SCORE.ARPA interview
C00808 00418 ∂30-May-85 0634 POURNE@MIT-MC.ARPA dinner time
C00810 00419 ∂30-May-85 0645 JF@SU-SUSHI.ARPA June money due for MJH coffee pool
C00814 00420 ∂30-May-85 1051 VAL situation calculus
C00816 00421 ∂30-May-85 1139 @seismo.ARPA:mcvax!kddlab!nttmecl!ccut!a1458@seismo.ARPA your visit to Japan
C00819 00422 ∂30-May-85 1236 YAO@SU-SCORE.ARPA Re: Your letter of April 10
C00821 00423 ∂30-May-85 1306 SMC
C00822 00424 ∂30-May-85 1537 CN.MCS@Lindy
C00825 00425 ∂30-May-85 2049 vardi@diablo re: Daniel Lehman
C00826 00426 ∂30-May-85 2057 CLT msg from rpg
C00827 00427 ∂30-May-85 2147 MRC@SU-SCORE.ARPA more on Czechoslovakian VAX
C00829 00428 ∂30-May-85 2225 POURNE@MIT-MC.ARPA dinner time
C00831 00429 ∂30-May-85 2249 TOB
C00834 00430 ∂30-May-85 2347 LES
C00835 00431 ∂31-May-85 1011 vardi@diablo re: Daniel Lehman
C00836 00432 ∂31-May-85 1047 HEDGES@SU-SCORE.ARPA Robotics Candidates
C00838 00433 ∂31-May-85 1117 SMC
C00839 00434 ∂31-May-85 1147 NILSSON@SU-SCORE.ARPA award
C00840 00435 ∂31-May-85 1532 LES Preliminary task
C00845 00436 ∂31-May-85 2323 ERIC@SU-CSLI.ARPA Re: job
C00847 00437 ∂01-Jun-85 0918 CLT
C00848 00438 ∂01-Jun-85 1110 JJW PUB from PARC
C00849 00439 ∂01-Jun-85 1119 RPG Soft Drinks
C00850 00440 ∂01-Jun-85 1706 ME Prancing Pony Bill
C00851 00441 ∂01-Jun-85 2119 VAL situation calculus
C00853 00442 ∂02-Jun-85 0726 VAL re: situation calculus
C00854 00443 ∂02-Jun-85 1336 ASHOK@SU-SUSHI.ARPA Faculty candidate
C00855 00444 ∂03-Jun-85 0855 ROSENBLOOM@SUMEX-AIM.ARPA Re: qual schedule
C00858 00445 ∂03-Jun-85 0904 CLT
C00859 00446 ∂03-Jun-85 1037 JF@SU-SUSHI.ARPA june money due
C00861 00447 ∂03-Jun-85 1034 VAL Circumscription Seminar
C00862 00448 ∂03-Jun-85 1321 PETTY@RUTGERS.ARPA 85-mailing
C00866 00449 ∂03-Jun-85 1919 PARK@SRI-AI.ARPA SciFi Costume Ball
C00869 00450 ∂03-Jun-85 1954 RESTIVO@SU-SCORE.ARPA Monadic program
C00873 00451 ∂04-Jun-85 0643 RA sick
C00874 00452 ∂04-Jun-85 0945 NILSSON@SU-SCORE.ARPA AI Retreat
C00877 00453 ∂04-Jun-85 0945 TULEY@SU-SCORE.ARPA message
C00878 00454 ∂04-Jun-85 1351 TULEY@SU-SCORE.ARPA msg
C00879 00455 ∂04-Jun-85 1506 SJG house initialization
C00880 00456 ∂04-Jun-85 1515 TULEY@SU-SCORE.ARPA
C00881 00457 ∂04-Jun-85 1620 TULEY@SU-SCORE.ARPA msg
C00882 00458 ∂04-Jun-85 1630 TULEY@SU-SCORE.ARPA msg
C00883 00459 ∂04-Jun-85 2039 @SU-SCORE.ARPA:bellcore!walker@Berkeley for your information: copy of a proposal intended to justify
C00904 00460 ∂05-Jun-85 0011 JJW Ideas on my thesis
C00919 00461 ∂05-Jun-85 1050 ullman@diablo Re: Ideas on my thesis
C00921 00462 ∂05-Jun-85 1056 NILSSON@SU-SCORE.ARPA AI Retreat Reconsidered
C00923 00463 ∂05-Jun-85 1157 RA Ellis Kroptechev film
C00924 00464 ∂05-Jun-85 1238 RA IJCAI 85
C00925 00465 ∂05-Jun-85 1333 EMMA@SU-CSLI.ARPA Re: two questions
C00926 00466 ∂05-Jun-85 1412 SAMI@SU-CSLI.ARPA Turing Account
C00927 00467 ∂05-Jun-85 1410 RA Alaska
C00928 00468 ∂05-Jun-85 1421 RA IJCAI
C00929 00469 ∂05-Jun-85 1430 ucscc!beeson%ucscd.ucscc.UUCP@Berkeley talk about my paper?
C00931 00470 ∂05-Jun-85 1426 RA Alaska
C00932 00471 ∂05-Jun-85 1538 TULEY@SU-SCORE.ARPA msg
C00933 00472 ∂05-Jun-85 1726 WILKINS@SUMEX-AIM.ARPA Re: your mci card
C00934 00473 ∂05-Jun-85 1908 RESTIVO@SU-SCORE.ARPA chess win
C00936 00474 ∂05-Jun-85 2055 VAL names without denotations
C00938 00475 ∂06-Jun-85 0603 BH point-to-point mail
C00939 00476 ∂06-Jun-85 1007 WILKINS@SUMEX-AIM.ARPA Re: your mci card
C00941 00477 ∂06-Jun-85 1027 WILKINS@SRI-AI.ARPA [John McCarthy <JMC@SU-AI.ARPA>: your mci card ]
C00943 00478 ∂06-Jun-85 1051 RA anchorage trip
C00944 00479 ∂06-Jun-85 1101 CLT
C00945 00480 ∂06-Jun-85 1128 INGRID@SU-CSLI.ARPA Your talk at the ASL Meeting
C00946 00481 ∂06-Jun-85 1139 INGRID@SU-CSLI.ARPA re: Your talk at the ASL Meeting
C00947 00482 ∂06-Jun-85 1247 CLT Remarks on Beeson's Logic and Knowledge
C00960 00483 ∂06-Jun-85 1259 SJG folly
C00961 00484 ∂06-Jun-85 1422 RA anchorage
C00962 00485 ∂06-Jun-85 1534 TULEY@SU-SCORE.ARPA message
C00963 00486 ∂06-Jun-85 1531 RA trip to anchorage
C00964 00487 ∂06-Jun-85 1645 GENESERETH@SUMEX-AIM.ARPA ai qual
C00966 00488 ∂06-Jun-85 1703 RA tickets
C00967 00489 ∂06-Jun-85 2323 CHEESEMAN@SRI-AI.ARPA Probability in AI Workshop
C00974 00490 ∂07-Jun-85 0140 HST gwai85
C00975 00491 ∂07-Jun-85 0900 JMC
C00976 00492 ∂07-Jun-85 0900 JMC
C00977 00493 ∂07-Jun-85 1052 KUO Make an appointment
C00978 00494 ∂07-Jun-85 1101 RA staff meeting
C00979 00495 ∂07-Jun-85 1144 RPG Thesis Ideas
C00982 00496 ∂07-Jun-85 1300 JMC
C00983 00497 ∂07-Jun-85 1449 RA IGCAI
C00984 00498 ∂07-Jun-85 2000 JMC
C00985 00499 ∂07-Jun-85 2318 SG Okamura (my father-in-law) / address and phone
C00986 00500 ∂08-Jun-85 0102 RUOFF@JPL-ROBOTICS.ARPA TECHIE
C00987 00501 ∂10-Jun-85 0003 JMC
C00988 00502 ∂10-Jun-85 0113 LLW@S1-A.ARPA SDI Computing
C00991 00503 ∂10-Jun-85 1102 RUOFF@JPL-ROBOTICS.ARPA TECHIE MAIL
C00993 00504 ∂10-Jun-85 1102 YAO@SU-SCORE.ARPA Shapiro
C00995 00505 ∂11-Jun-85 0806 AI.JMC@MCC.ARPA 3600s
C00996 00506 ∂11-Jun-85 0924 RA Prof. Leo Goodman
C00997 00507 ∂11-Jun-85 1519 RA IGCAI
C00998 00508 ∂11-Jun-85 1547 AI.JMC@MCC.ARPA letter
C00999 00509 ∂11-Jun-85 1552 RA [Reply to message recvd: 11 Jun 85 15:32 Pacific Time]
C01000 00510 ∂11-Jun-85 2300 JMC
C01001 00511 ∂12-Jun-85 0000 JMC
C01002 00512 ∂12-Jun-85 0129 RMS@MIT-MC.ARPA Job: full-time GNU hacker wanted (please post widely)
C01005 00513 ∂12-Jun-85 0940 RA visa
C01006 00514 ∂12-Jun-85 1501 JMM comments on your msg--India vs China
C01010 00515 ∂12-Jun-85 1712 RA Sarah
C01011 00516 ∂12-Jun-85 1730 SHAWN@SU-SUSHI.ARPA CS206 Grade and Thanks
C01013 00517 ∂12-Jun-85 2052 GLB
C01014 00518 ∂12-Jun-85 2254 LES re: WAITS to TEX conversion
C01016 00519 ∂13-Jun-85 0905 CLT jmc
C01017 00520 ∂13-Jun-85 1038 RINDFLEISCH@SUMEX-AIM.ARPA Instructional Lisp Machines
C01022 00521 ∂13-Jun-85 1246 YAO@SU-SCORE.ARPA Shapiro's visit
C01024 00522 ∂13-Jun-85 1306 SJG probability workshop
C01026 00523 ∂13-Jun-85 1350 RA J.W. Lloyd
C01027 00524 ∂13-Jun-85 1348 MRC@SU-SCORE.ARPA Re: concepts of fairness
C01030 00525 ∂13-Jun-85 1406 RA Frank, Dina Bolla
C01031 00526 ∂13-Jun-85 1416 MRC@SU-SCORE.ARPA Vietnam: trying to be moderate
C01036 00527 ∂13-Jun-85 1423 MRC@SU-SCORE.ARPA re: Support Senate Bill 329 (from SAIL's BBOARD)
C01038 00528 ∂13-Jun-85 1445 SG Masahiko's address
C01039 00529 ∂13-Jun-85 1524 avg@diablo re: Support Senate Bill 329
C01041 00530 ∂13-Jun-85 1649 TREITEL@SU-SUSHI.ARPA re: Support Senate Bill 329
C01043 00531 ∂13-Jun-85 1702 RA lodging in Alaska
C01045 00532 ∂13-Jun-85 1704 RA David Chudnovsky
C01046 00533 ∂13-Jun-85 1914 YAO@SU-SCORE.ARPA re: Shapiro's visit
C01047 00534 ∂14-Jun-85 0832 AI.LENAT@MCC.ARPA Re: next visit
C01051 00535 ∂14-Jun-85 1015 KONOLIGE@SRI-AI.ARPA default reasoning
C01055 00536 ∂14-Jun-85 1148 JF@SU-SUSHI.ARPA i agree with you
C01057 00537 ∂14-Jun-85 1156 AI.LENAT@MCC.ARPA Re: next visit
C01058 00538 ∂14-Jun-85 1249 FEIGENBAUM@SUMEX-AIM.ARPA Re: leaf blowers
C01059 00539 ∂14-Jun-85 1551 RINDFLEISCH@SUMEX-AIM.ARPA Re: Instructional Lisp Machines
C01061 00540 ∂14-Jun-85 1604 FEIGENBAUM@SUMEX-AIM.ARPA Re: Instructional Lisp Machines
C01064 00541 ∂14-Jun-85 2156 GENESERETH@SUMEX-AIM.ARPA Re: Instructional Lisp Machines
C01066 00542 ∂15-Jun-85 1024 NILSSON@SU-SCORE.ARPA Re: Shapiro's visit
C01068 00543 ∂15-Jun-85 1100 NILSSON@SU-SCORE.ARPA Re: Instructional Lisp Machines
C01070 00544 ∂15-Jun-85 1118 NILSSON@SU-SCORE.ARPA AI Retreat Concluded
C01072 00545 ∂15-Jun-85 2220 udi%wisdom.bitnet@WISCVM.ARPA Talk
C01074 00546 ∂17-Jun-85 1023 TW
C01075 00547 ∂17-Jun-85 1004 VAL Re: default reasoning
C01078 00548 ∂17-Jun-85 1450 KONOLIGE@SRI-AI.ARPA Re: default reasoning
C01082 00549 ∂17-Jun-85 1524 NILSSON@SU-SCORE.ARPA Re: default reasoning
C01083 00550 ∂18-Jun-85 0153 @seismo.ARPA:munnari!mulga.oz!jwl@seismo.ARPA
C01088 00551 ∂18-Jun-85 1142 RA Circuit from PA times
C01089 00552 ∂20-Jun-85 1348 AI.HILL@MCC.ARPA MCC Consulting Contract
C01090 00553 ∂20-Jun-85 1353 CLT calendar item
C01091 00554 ∂21-Jun-85 1507 RA Fred Ris from IBM
C01092 00555 ∂22-Jun-85 1602 SHORTLIFFE@SUMEX-AIM.ARPA Re: AI Retreat
C01094 00556 ∂24-Jun-85 1016 HEDGES@SU-SCORE.ARPA Visit of Jean-Claude Latombe
C01096 00557 ∂24-Jun-85 1200 RA Sandra Cook SRI
C01097 00558 ∂24-Jun-85 1358 FEIGENBAUM@SUMEX-AIM.ARPA [AIList Moderator Kenneth Laws <AIList-REQUEST@SRI-AI>: AIList Digest V3 #82]
C01126 00559 ∂25-Jun-85 1205 CLIFF@USC-ISI.ARPA Arpa Order 4912
C01128 00560 ∂26-Jun-85 0229 HST gwai85
C01129 00561 ∂26-Jun-85 0316 ARK TeX Videotape
C01130 00562 ∂26-Jun-85 0854 RA Beverly Hilton Reservation
C01131 00563 ∂27-Jun-85 1343 HEDGES@SU-SCORE.ARPA Robotics Search Committee meeting with JC Latombe
C01133 00564 ∂27-Jun-85 1701 RA check
C01134 00565 ∂28-Jun-85 0830 KUO IJCAI-85
C01136 00566 ∂28-Jun-85 1704 JF@SU-SUSHI.ARPA July Coffee Money due
C01138 ENDMK
C⊗;
∂01-Apr-85 0707 AI.WOODY@MCC.ARPA [John McCarthy <JMC@SU-AI.ARPA>: repeat of earlier message ]
Received: from MCC.ARPA by SU-AI.ARPA with TCP; 1 Apr 85 07:05:57 PST
Date: Mon 1 Apr 85 09:04:54-CST
From: Woody Bledsoe <AI.Woody@MCC.ARPA>
Subject: [John McCarthy <JMC@SU-AI.ARPA>: repeat of earlier message ]
To: Jmc@SU-AI.ARPA, cl.boyer@UTEXAS-20.ARPA
cc: AI.Woody@MCC.ARPA
John and Bob,
I had suggested April 11 and 12 because of Bob's partial conflict
earlier in the week. I too have at least half of my time tied up
on April 8-9, but that need not matter if you two can agree on
the dates. (And let me know).
Ai.Barbara@mcc can make reservations if you like.
Woody
---------------
Return-Path: <JMC@SU-AI.ARPA>
Received: from SU-AI.ARPA by MCC.ARPA with TCP; Sun 31 Mar 85 02:47:22-CST
Date: 31 Mar 85 0046 PST
From: John McCarthy <JMC@SU-AI.ARPA>
Subject: repeat of earlier message
To: ai.woody@MCC.ARPA
How about Monday the 8th and Tuesday the 9th?
-------
∂01-Apr-85 0912 EMMA@SU-CSLI.ARPA new mailing list
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 1 Apr 85 09:12:27 PST
Date: Mon 1 Apr 85 09:08:47-PST
From: Emma Pease <Emma@SU-CSLI.ARPA>
Subject: new mailing list
To: rrr@SU-CSLI.ARPA
Tel: 497-3479
A new mailing list on the Role of Representation in Reasoning has
been formed. All inquiries should be directed to Briansmith@xerox.
The name of the list is RRR.
-Emma
-------
∂01-Apr-85 0936 LAWS@SRI-AI.ARPA [John McCarthy <JMC@SU-AI.ARPA>: Subject: Hofstader on sexist language (from SAIL's BBOARD) ]
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 1 Apr 85 09:35:45 PST
Date: Mon 1 Apr 85 09:33:25-PST
From: Ken Laws <Laws@SRI-AI.ARPA>
Subject: [John McCarthy <JMC@SU-AI.ARPA>: Subject: Hofstader on sexist language (from SAIL's BBOARD) ]
To: JMC@SU-AI.ARPA
jmc - Sarcasm often makes adherents of one side of a controversy feel
better, but it rarely convinces opponents or even the undecided.
Thus it hasn't affected my negative view of attempts to purge the
English language.
The logic in your message would be tighter if you omit the word "thus".
(Don't mind me, I'm just in a nit-picking mood this morning.)
-- Ken Laws
-------
∂01-Apr-85 0937 ullman@diablo NAIL!
Received: from SU-AIMVAX.ARPA by SU-AI.ARPA with TCP; 1 Apr 85 09:37:41 PST
Date: Mon, 1 Apr 85 09:37:45 pst
From: Jeff Ullman <ullman@diablo>
Subject: NAIL!
To: jmc@sail
By the way, I just wanted to say that you are most welcome to
join the group. As usual, I'm floundering around in an area
i only dimly understand, and everyone would appreciate your
influence.
∂01-Apr-85 1434 VAL NAIL
I did get an error message from Mailer. What else can I try to get on the list?
∂01-Apr-85 1505 YAO@SU-SCORE.ARPA search committee
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 1 Apr 85 15:05:29 PST
Date: Mon 1 Apr 85 14:40:00-PST
From: Andrew Yao <YAO@SU-SCORE.ARPA>
Subject: search committee
To: JMC@SU-AI.ARPA, Papa@SU-SCORE.ARPA
cc: yao@SU-SCORE.ARPA
Dear John and Christos,
I'm glad that you have agreed to serve on this committee to search for
a possible faculty, with execellence the criterion independent of
specialties. The three of us, plus a student member to be named later,
will constitute the committee.
I propose that we should meet in the near future to discuss the search.
Nils gave me two folders of possible candidates who had expressed an
interest in a position at Stanford at various times. Of course we can
add other names to these lists. I will bring the folders to the meeting
so that we can look them over. Nils is going to meet the Dean soon, and
if he gets the permission from the Dean, which he expects to get, then
we can start interview candidates.
Let me propo this Wednesday (April 3) at 11am as our first meeting time. Is time is not convenient, how about 2pm on April 3? How about 2pm on April 5?
Please let me know which of the above times are not good for you. Hopefully
we can find one that is good for all of us.
Thanks.
---Andy
-------
∂01-Apr-85 1855 YAO@SU-SCORE.ARPA meeting time
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 1 Apr 85 18:55:48 PST
Date: Mon 1 Apr 85 18:55:25-PST
From: Andrew Yao <YAO@SU-SCORE.ARPA>
Subject: meeting time
To: JMC@SU-AI.ARPA
cc: yao@SU-SCORE.ARPA
John, it seems that Friday (April 5) would be better if you have to rush
on Wednesday. Would Friday at 2:00 be a good time to meet for you? Thanks.
--Andy
-------
∂02-Apr-85 0041 cheriton@Pescadero Common business communication language
Received: from SU-PESCADERO.ARPA by SU-AI.ARPA with TCP; 2 Apr 85 00:41:13 PST
Date: Tue, 2 Apr 85 00:41:02 pst
From: David Cheriton <cheriton@Pescadero>
Subject: Common business communication language
To: jmc@su-ai
Nils mentioned that you had a talk/crusade on something like this
(which was not Cobol). From what Nils said, it sounds possibly
relevant to an experimental course I am running this quarter on
(more or less) high-level application systems design.
1. Do you have anything written on this that I might read?
2. Would you have time at some point to discuss this otherwise?
Thanks
∂02-Apr-85 0656 JJW SPIDER
∂02-Apr-85 0013 JMC
The April Fool spider appears to be slightly easier than the ordinary.
JJW - I'm not sure who did it; they covered their tracks pretty well.
∂02-Apr-85 0659 AI.WOODY@MCC.ARPA Re: next visit
Received: from MCC.ARPA by SU-AI.ARPA with TCP; 2 Apr 85 06:58:34 PST
Date: Tue 2 Apr 85 08:58:08-CST
From: Woody Bledsoe <AI.Woody@MCC.ARPA>
Subject: Re: next visit
To: JMC@SU-AI.ARPA, cl.boyer@UTEXAS-20.ARPA
cc: AI.Woody@MCC.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Mon 1 Apr 85 09:19:00-CST
Yes, lets make it definite for April 11-12. John, we will reserve you
a room at the Brookhollow (as before) for April 10-12. Someone can
meet your flight if you let us know, or take a taxi if you prefer,
or whatever.
Woody
-------
∂02-Apr-85 0949 NILSSON@SU-SCORE.ARPA CS=>Engrg
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 2 Apr 85 09:46:09 PST
Date: Tue 2 Apr 85 09:45:29-PST
From: Nils Nilsson <NILSSON@SU-SCORE.ARPA>
Subject: CS=>Engrg
To: jmc@SU-AI.ARPA
cc: nilsson@SU-SCORE.ARPA
I agree that an important consideration for CS is straightening out our
relations with EE over the courses we both teach, a possible UG major,
faculty hires, and research areas. In principle, this "straightening out"
might be achievable with EE in Engrg. and with CS remaining in H&S. I think
the practical difficulties in doing so under the current situation though
are quite extreme. Our move into Engrg carries with it an agreement with
EE that I think is quite good. Working with EE on these matters is simply
going to be much easier if CS is in Engrg. (I agree with Vaughn about
the Berkeley matter.)
I'm pretty sure that further negotiations with Engrg. (as you suggest) would
come to pretty much the same recommendations as contained in my memo. The
reason for my confidence about that is that several of us have already put
a lot of thought into the matter, and the memo is really the result of this
joint effort--not just mine. -Nils
-------
∂02-Apr-85 1010 GANGOLLI@SU-SCORE.ARPA Bert Enderton
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 2 Apr 85 10:10:08 PST
Date: Tue 2 Apr 85 10:05:42-PST
From: Anil Gangolli <GANGOLLI@SU-SCORE.ARPA>
Subject: Bert Enderton
To: rosenbloom@SUMEX-AIM.ARPA, jmc@SU-AI.ARPA, dcl@SU-AI.ARPA, tw@SU-AI.ARPA
cc: GANGOLLI@SU-SCORE.ARPA
We have a newly admitted PhD student, Bert Enderton, who is coming to
visit this Friday, April 5. He would like to speak with each of you.
Please send me a list of times when you would be free to speak with
him, (for about a half hour, I expect). Thanks.
--anil. (recruitment/orientation committee)
-------
∂02-Apr-85 1020 YAO@SU-SCORE.ARPA search committee meeting
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 2 Apr 85 10:19:52 PST
Date: Tue 2 Apr 85 10:19:38-PST
From: Andrew Yao <YAO@SU-SCORE.ARPA>
Subject: search committee meeting
To: JMC@SU-AI.ARPA, Papa@SU-SCORE.ARPA
cc: yao@SU-SCORE.ARPA, Lamping@SU-SCORE.ARPA, Nilsson@SU-SCORE.ARPA
I have reserved conference room 252 for a first search committee meeting
on Friday (April 5) at 2 pm. I imagine the meeting will last from
1 to 1 and a half hours. I will bring the folders containing the
names of posssible candidates we have from Nils' record. We will
take a look at them, and discuss what to do in the future.
Thanks.
--Andy
-------
∂02-Apr-85 1310 RA [Reply to message recvd: 02 Apr 85 00:44-PST]
What does CBCL stand for?
∂02-Apr-85 1329 YAO@SU-SCORE.ARPA [Nils Nilsson <NILSSON@SU-SCORE.ARPA>: candidates]
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 2 Apr 85 13:24:51 PST
Date: Tue 2 Apr 85 13:23:24-PST
From: Andrew Yao <YAO@SU-SCORE.ARPA>
Subject: [Nils Nilsson <NILSSON@SU-SCORE.ARPA>: candidates]
To: JMC@SU-AI.ARPA, Papa@SU-SCORE.ARPA
I just received this from Nils.
---------------
Mail-From: NILSSON created at 2-Apr-85 12:47:24
Date: Tue 2 Apr 85 12:47:24-PST
From: Nils Nilsson <NILSSON@SU-SCORE.ARPA>
Subject: candidates
To: yao@SU-SCORE.ARPA
cc: nilsson@SU-SCORE.ARPA
Andy, I won't be able to attend the search committee mtg on
Friday (I'll be out of town), but I did want you to have the
attached list of names. (I will probably think of more as
time goes on.) -Nils
Faculty Candidates
Ehud Shapiro <Udi%Wisdom.bitnet@WISCVM.ARPA>
David Barstow, Schlumberger
Richard Fateman, UCBerkeley
Hector Garcia Molina, Princeton
Fernando Pereira, SRI
Dan Friedman, Indiana
Leslie Lamport, SRI
Joe Halpern, IBM
Ken Bowen,Syracuse
Barbara Grosz, SRI
-------
-------
∂02-Apr-85 1415 NILSSON@SU-SCORE.ARPA re: [Nils Nilsson <NILSSON@SU-SCORE.ARPA>: candidates]
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 2 Apr 85 14:13:00 PST
Date: Tue 2 Apr 85 14:09:41-PST
From: Nils Nilsson <NILSSON@SU-SCORE.ARPA>
Subject: re: [Nils Nilsson <NILSSON@SU-SCORE.ARPA>: candidates]
To: JMC@SU-AI.ARPA
cc: YAO@SU-SCORE.ARPA, Papa@SU-SCORE.ARPA, NILSSON@SU-SCORE.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Tue 2 Apr 85 13:46:00-PST
Let's also add Vladimir Lifschitz, James Allen (UofRochester) and
John Hopcroft (Cornell). -Nils
-------
∂02-Apr-85 1435 PB "cretin"
PB - JMC may be amused to learn that the origin of the word "cretin" is from
the French cr\'etin, a variation of chr\'etien, meaning "Christian."
∂02-Apr-85 1657 RA Peat Marwick
Maly Cooper from Peat Marwick called, (55) 981 8230. She said you'd know
what it's about.
∂02-Apr-85 2021 BRESNAN@SU-CSLI.ARPA Linguistics Drinks Resume Fridays
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 2 Apr 85 20:13:22 PST
Date: Tue 2 Apr 85 20:09:51-PST
From: Joan Bresnan <BRESNAN@SU-CSLI.ARPA>
Subject: Linguistics Drinks Resume Fridays
To: researchers@SU-CSLI.ARPA, RAS@SU-CSLI.ARPA, visitors@SU-CSLI.ARPA,
folks@SU-CSLI.ARPA, friends@SU-CSLI.ARPA
To Linguists of All Persuasions & Affiliations--
Starting this Friday, April 5, on the full moon of the month
drinks will resume in the Lounge of Linguistics, Building 100, at
4:30 p.m. Everyone with any affinal, agnatal, intellectual, or
disinterested connection to linguistics is welcome. You may also
wish to come unconnected, simply to observe real linguists, who
are known for their charisma, panache, and eloquence under drink,
interact ("interact": a California euphemism for . . . what we'll
be doing).
Your hostess will be a noted theoretical linguist (someone has
noted everything, Berkeley).
-------
∂03-Apr-85 0803 FAGAN@SUMEX-AIM.ARPA [Larry Fagan <FAGAN@SUMEX-AIM.ARPA>: Request for Support for AI in Medicine Workshop]
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 3 Apr 85 08:03:34 PST
Date: Wed 3 Apr 85 08:03:31-PST
From: Larry Fagan <FAGAN@SUMEX-AIM.ARPA>
Subject: [Larry Fagan <FAGAN@SUMEX-AIM.ARPA>: Request for Support for AI in Medicine Workshop]
To: jmc@SU-AI.ARPA
Dear Prof. McCarthy,
I sent the following message to Woody in mid-February, and his reply
was that he had forwarded the message on to you. I wanted to find out
if any action had taken place. We are trying to determine the number
of graduate students that can be invited, and that number depends on
the funding requested in this note.
Thanks,
Larry Fagan
Senior Research Associate
National Liason, SUMEX Project
---------------
Date: Thu 14 Feb 85 07:24:16-PST
From: Larry Fagan <FAGAN@SUMEX-AIM.ARPA>
Subject: Request for Support for AI in Medicine Workshop
To: Bledsoe@UTEXAS-20.ARPA
cc: Kingsland@SUMEX-AIM.ARPA, Shortliffe@SUMEX-AIM.ARPA
Dear Woody,
I'm writing to you on behalf of the organizing committee for the 1985
Workshop on Artificial Intelligence in Medicine (an annual event that has
been occuring since the mid-1970's). This year's workshop will be held at the
National Library of Medicine in Bethesda, MD. on July 10-12. As in the past,
the workshop will be designed to communicate recent results in medical
applications among the researchers in the area, including their senior
graduate students.
Last year, the AAAI kindly provided a $5,000 grant to allow more
graduate students to attend the meeting than would otherwise have been
possible. We are hopeful that a similar AAAI grant will be possible this
year, possibly at a higher funding level ($7500 or $8000). If additional
funds were available, then a few more students would be able to present
their work and learn about the activities of others in the discipline. I
found the AIM Workshops to be particularly valuable learning experiences
when I was involved with my own doctoral dissertation, and I would like to
see current AIM students have similar opportunities to meet (and present
their work to) the leaders in the field. Over the years, the AIM
community has provided the direction for much of the research in expert
systems. Assistance from AAAI will help provide important support this
active area of AI research.
Thank you for considering this request. Please let me know if I
can provide further information to you or the members of the AAAI Council.
Regards,
Larry Fagan
-------
-------
∂03-Apr-85 0925 RA CBCL
There are no copies of CBCL in your file cabinet. Which file is it in?
∂03-Apr-85 0932 WALDINGER@SRI-AI.ARPA Re: faculty lunches
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 3 Apr 85 09:31:33 PST
Date: Wed 3 Apr 85 09:30:19-PST
From: WALDINGER@SRI-AI.ARPA
Subject: Re: faculty lunches
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Tue 2 Apr 85 14:34:00-PST
thanks for the invitation to the faculty free lunches. i think
i will be able to come this coming tuesday.
-------
∂03-Apr-85 0941 SHORTLIFFE@SUMEX-AIM.ARPA re: [Larry Fagan <FAGAN@SUMEX-AIM.ARPA>: Request for Support for AI in Medicine Workshop]
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 3 Apr 85 09:41:45 PST
Date: Wed 3 Apr 85 09:41:38-PST
From: Ted Shortliffe <Shortliffe@SUMEX-AIM.ARPA>
Subject: re: [Larry Fagan <FAGAN@SUMEX-AIM.ARPA>: Request for Support for AI in Medicine Workshop]
To: JMC@SU-AI.ARPA
cc: FAGAN@SUMEX-AIM.ARPA, aaai-office@SUMEX-AIM.ARPA, Bledsoe@UTEXAS-20.ARPA,
Kingsland@SUMEX-AIM.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Wed 3 Apr 85 09:26:00-PST
Office: Room TC-135, Stanford Med Center; Phone: (415) 497-6979
Thanks very much, John. This will really help, and the support is
much appreciated.
Ted
-------
∂03-Apr-85 1118 MDD
The address you have is fine & what you requested is on its way.
-Martin
P.s. I very rarely read mail on SU-AI
∂03-Apr-85 1218 MDD
Yes I would like mail to MDD forwarded to DAVISM@NYU. Thank you.
I had a long chat recently with Don Perlis about circumscription.
Yes, I'd be glad to get your recent papers on the subject.
-Martin
∂03-Apr-85 1414 RA Cuthbert Hurd
Hurd is trying to get in touch with you. He'll be at 494 3612 for the
next hour and then at 854 1901. If he doesn't hear from you, he'll call
you at home tonigt.
Sam Daniel of Motorola may call me about a possible presentation of
a multiprocesor based on the 680020.
602 897-4306, I'll call him today or tomorrow.
∂03-Apr-85 1619 LES Digital Utility Centers
Date: Wed 20 Mar 85 08:34:59-EST
From: Wayne McGuire <MDC.WAYNE%MIT-OZ@MIT-MC.ARPA>
Subject: Digital Utility Centers
To: info-micro@BRL-VGR.ARPA, videotech@SRI-CSL.ARPA
It's become apparent in recent weeks that the bottom has fallen
out of the home computer market. Whether the collapse in demand for
home computers will equal in severity the videogame bust of a few
years ago is still an open question, but that possibility must be
taken into account.
A column by Fred D'Ignazio in the April Compute! suggests what
is required before home computers become as common as the telephone:
namely, the massive and seamless integration of a number of
technologies--videodiscs, optical fibers, expert systems, portable
laptop computers, speech recognition, videotex, the Integrated
Services Digital Network (ISDN), integrated software, artificial
intelligence, satellite communications, speech synthesis, natural
language understanding, television, telephony, etc.
D'Ignazio argues that as powerful as the new generation of micros
appears compared to what was available a few years ago, microcomputer
technology, and its Worldnet environment, will have to improve by many
orders of magnitude before micros become an appliance for the masses.
He may have a point:
From Compute!, April 1985, pp. 138-140:
Experts predict that a real home computer will not appear until
computers are integrated into all aspects of people's lives, including
banking, shopping, working, communicating, and entertainment. A real
home computer will not sit alone on a desktop and look like a
typewriter plugged into a TV set. Instead, it will be a hybrid
machine--part TV, part telephone, part videocassette recorder, and
part stereo system. It will be the brains of a general-purpose
digital utility center that a family operates to hear music, watch
movies and TV, make phone calls, control household appliances, and pay
bills.
The home computer of the present is made up of awkward,
ill-fitted, and confusing components. The day its components fuse
together into a single digital utility center that is sold at discount
supermarkets, it will truly become a mass-market device.
The digital utility center will come in a single box and plug
into the wall with a single cord. The center's audio, video, and
computer software will be uniform and standardized (in some kind of
optical or magnetic format), and will play everything--from
educational games to Bruce Springsteen to the latest Burt Reynolds
movie.
All the recordings will be digital and capable of being stored on
a single, high-density storage device. All programming will be in
English and will consist of making simple choices from a menu of
selections that appears on a screen and are read to the user aloud by
the center's synthesized voice. Input will be from a keyboard, light
pen, mouse, microphone, or touch screen, depending on the individual's
preference. No technical knowledge whatsoever will be needed to
operate the center. And the center will come with one- to five-year
warranties, full service contracts, and modular, replaceable parts.
When the digital utility center arrives, the home computer will
really be a mass-market appliance. But when computers have become
digital utility centers, they will no longer be computers. To
paraphrase Joseph Weizenbaum, a digital utility center to a computer
is the same as a vacuum cleaner to an electric motor.
Before we see consumers going wild over digital utility centers,
a lot of separate developments have to take place. Audio, video,
communications, and computer hardware must evolve much further and
become more integrated, digital, compatible and inexpensive. Software
for the separate devices has to be integrated under a single
multimedia operating system and has to adopt a standardized storage
and data interchange format.
In addition, the software must have a friendly, human-like
mouthpiece that deals with us in our natural, spoken language and is
not only user-friendly but also user-forgiving. The software will
have to fill in the gaps in people's commands, correct their typos and
misspellings, not let them make any serious mistakes, hold their hand
as they work their way through a task, and anticipate what they will
want to do next.
Most important of all, a mass-market home computer will require a
reliable, universal communications network that links the digital
utility center into very-high-speed satellite channels that support
two-way instantaneous transmission of voices, music, video images,
computer-generated pictures, text, and numerical data. This network,
too, must be standardized, instantly available at the push of a CALL
button on the digital utility center, and invisible to the user.
Only when such a network is in place will the digital utility
center become popular with a majority of consumers. Only then will
all the pie-in-the-sky promises of computer enthusiasts become
possible.
Such a network will make it possible to do home banking,
telecommuting, shopping at home, and attending courses and classes at
home. People will be able to purchase all the new records, movies,
computer software, and books over the network and have them downloaded
into into their local mass-storage device or into a portable computer
that they can detach from the main unit and carry with them when they
travel.
The lesson in all this is that our vision of the home computer
has been too limited, and that's why we keep having false starts. Our
vision has been limited by the fact that we are still too close to the
computer's birth; we are still too familiar with the computer's early
stages and functions to see what it may ultimately become.
We are only now beginning to move beyond the image of the
computer as a computing engine that juggles numbers and processes
paychecks. But we must go much further. We must see the computer as
only a part of the digital revolution of all human media--voice,
music, art, graphics, film, literature, and so on. As all science,
art, technology, and communications are digitized, the computer
assumes a central role as a translator among the media, and as a
terminal linking human beings to the media and to each other.
The computer should enable the average person to enter
information in any medium (pictures, voice, text, whatever) and
instantly translate it (at the discretion of the person) into any
other medium--or into several different media. It should then enable
the person to send the package to any other person. Likewise, anyone
who uses a computer should have instant access to all media in any
format they wish.
This sounds extremely abstract, so picture the home computer of
the future as the United Nations Building. It will have two major
functions: translator and terminal. It will house all the disparate
streams of digitized information representing all the different media,
and it will translate them back and forth at the needs and whims of
the user. And it will be plugged into the outside world (of cultures,
peoples, nations, and institutions) and capable of vital two-way
communication with that world in any language that is appropriate.
------------------------------
Date: 25 Mar 85 23:05 +0100
From: Richard←Friedman←PSR%QZCOM.MAILNET@MIT-MULTICS.ARPA
Subject: World Ear Project from KPFA-FM in Berkeley Ca.
(Text 96800) 85-03-20 20:53 Richard Friedman PSR (several receivers)
Lines: 45
Subject: World Ear Project - An Invitation to All.
------------------------------------------------------------
This is an open invitation to all COM participants around the
world to also participate in the World Ear Project, currently
being organized by the Berkeley (California) non-commercial
VHF radio station KPFA . The goal is to produce a series of
radio programs (monthly for now) using ambient sound material
recorded by people around the world and sent to KPFA. These
programs are currently being aired on KPFA (program #2 is March 25)
and will be distributed later to other radio stations in the US
and, hopefully, around the world.
With the recent advances in tape recorder technology, very hight
quality recordings (in stereo) can now be made by the general public
on cassette recorders costing $200 to $400. Ten years ago, when I
started the Project (it lasted only a few months then) this quality
was available only at the high end of the portable tape recorder
market, for more than $1000. We at KPFA have now revitalized the
World Ear Project after noting that there was already a growing number
of recording enthusiasts trading tapes of sounds from exotic (and
not so exotic) places.
What better way to reach a world-wide audience than thru COM!
So here we are inviting anyone to participate who has one of these
high quality cassette or reel-to-reel stereo portable recorders.,
to go out into the field (city streets, open places, buildings, etc.)
and make extended recordings of the "sonic landscape", send them
to us, and they will become part of our programs.
Send tapes to World Ear Project
Music Dept.
KPFA-FM
Berkeley, CA USA 94704
Due to the meagre budget we have to work with, we cannot return the
recordings, so make a copy for yourself and send us the originals.
Include written information about the landscape recorded and about
the recording process itself. We will let you know if it gets
included in a broadcast and when.
We'll also send you a World Ear Poster, currently being printed.
For more information, send me COM mail.
In or next program, on March 25, we will be broadcasting the sounds
of the streets of Tunis, a sunrise near Darwin, Australia, frogs and
crickets at Harbin Hot Springs, in Northern California, the sounds of
a hospital in Los ANgeles, etc etc.
(Text 96800)------------------------------ (1 comment)
------------------------------
Date: 28 March 1985 02:32-EST
From: Steven A. Swernofsky <SASW @ MIT-MC>
Subject: [JOHN: Fredkin Seminar]
MSG: *MSG 3856
Date: 03/27/85 17:23:43
From: JOHN at MIT-XX
Re: Fredkin Seminar
Date: Wed 27 Mar 85 17:27:12-EST
From: John J. Doherty <JOHN@MIT-XX.ARPA>
Subject: Fredkin Seminar
To: bboard@MIT-MC.ARPA
cc: john@MIT-XX.ARPA
SEMINAR
DATE: April 1, 1985
TIME: Refreshments 1:50 P.M.
Seminar 2:00 P.M.
PLACE: NE43-512A
COMPUTER COMMUNITIES SEMINAR SERIES
COMPUTATION AND SOCIAL SYSTEMS
Prof. Edward Fredkin
M.I.T.
Chairman: Fredkin Enterprises, S.A.
ABSTRACT
The social organization of a country can have a great effect on the
possible benefits that can be derived from modern computer technology.
A case in point is the dilemma faced by the Soviet Union. They cannot
move into the modern computer age while maintaining their current
rigid controls on the flow of information within the USSR. This
dilemma is made especially clear when one considers the consequences
of millions of personal computers distributed throughout the Soviet
Union.
------------------------------
Date: Fri, 22 Mar 85 21:43:57 pst
From: allegra!princeton!down!daemon@Berkeley
PROGRAM FOR MEETING OF SOCIETY FOR PHILOSOPHY AND PSYCHOLOGY
University of Toronto, Wednesday May 15 - Saturday May 18, 1985
For copy of symposium abstracts and more information about the
program [note that there may still be room for some discussants or
speakers], the usenet address for the Program Chairman, Stevan
Harnad, is: bellcore!princeton!mind!srh
or write to: Stevan Harnad, Behavioral & Brain Sciences, 20 Nassau
Street, Suite 240, Princeton NJ 08540
For information about local arrangements, write to: David Olson,
McLuhan Center, University of Toronto, Toronto, Ontario, CANADA
For information about the Society and attendance, write to:
Owen Flanagan, Secretary/Treasurer, Society for Philosophy &
Psychology, Philosophy Department, Wellesley College, Wellesley,
MA 02181 Program follows [participant lists are in several cases
only partial; other contributors will also be on the program]:
Workshop (2 full sessions)
Ia & Ib. Artificial Intelligence Versus Neural Modeling in
Psychological Theory Participants include: P. & P. Churchland, P.C.
Dodwell, J. Feldman, A. Goldman, S. Grossberg, S.J. Hanson, A.
Newell, A. Pellionisz, R. Schank.
Symposia (10)
II. Category Formation
Participants include: S. Harnad, R. Jackendoff, N. Macmillan,
C. Mervis, R. Millikan, R. Schank.
III. Unconscious Processing
Participants include: T. Carr, A. Marcel, P. Merikle.
IV. Memory and Consciousness
Participants include: K. Bowers, M. Moscovitch, D. Schacter,
A. Marcel, R. Lockhart, E. Tulving.
V. New Directions in Evolutionary Theory
Participants include: A. Rosenberg, M. Ruse, E. Sober.
VI. Paradoxical Neurological Syndromes
Participants include: M. Gazzaniga, A. Kertesz, A. Marcel.
VII. The Empirical Status of Psychoanalytic Theory
Participants include: M. Eagle, E. Erwin, A. Grunbaum, J. Masling,
B. von Eckardt.
VIII. The Scientific Status of Parapsychological Research
Participants include: J. Alcock, C. Honorton, R.L. Morris, M. Truzzi.
IX. The Reality of the "G" (General) Factor in the Measurement and
Modeling of Intelligence
Participants include: A. Jensen, W. Rozeboom.
X. The Ascription of Knowledge States to Children: Seeing,
Believing and Knowing
Participants include: D. Olson & J. Astington, J. Perner & H. Wimmer,
M. Taylor & J. Flavell, F. Dretske, S. Kuczaj.
XI. Psychology, Pictures and Drawing
Participants include: J. Caron-Prague, S. Dennis, J. Kennedy,
D. Pariser, S. Wilcox, J. Willats, S. Brison
Contributed Paper Sessions (4):
XII. Perception and Cognition
XIII. Induction and Information
XIV. Evolution of Cognitive and Social Structures
XV. Inferences About the Mind
------------------------------
End of HUMAN-NETS Digest
************************
∂04-Apr-85 1038 RA Parallel LISP
Elia Weixelbaum AT&T Bell Lab, New Jersey (201) 386 7407 re: his work
on parallel LISP. Wanted to discuss with you your work on the subject.
He'll be in his office today; he will be on vacation beginning tomorrow
until a week from Monday. If he doesn't hear from you today, he will call
back in 10 days.
∂04-Apr-85 1135 VARDI@SU-CSLI.ARPA Daniel Lehman
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 4 Apr 85 11:35:19 PST
Date: Thu 4 Apr 85 11:33:08-PST
From: Moshe Y. Vardi <VARDI@SU-CSLI.ARPA>
Subject: Daniel Lehman
To: barwise@SU-CSLI.ARPA, john@SU-CSLI.ARPA, jmc@SU-AI.ARPA, stan@SRI-AI.ARPA,
bmoore@SRI-AI.ARPA, israel@SRI-AI.ARPA, goguen@SRI-CSL.ARPA
cc: djl.brandeis@CSNET-RELAY.ARPA
Danny Lehman is a Israeli computer scientist who has been doing work is
program semantics and in the theory of knowledge (interaction of knowledge
and time). He is now spending a sabbatical at Brandeis, and would like
to visit Stanford and SRI by the end of May or in June. Are you going to
be around here? Is it possible to support his trip here?
Moshe
-------
∂04-Apr-85 1330 CL.SHANKAR@UTEXAS-20.ARPA Church-Rosser paper
Received: from UTEXAS-20.ARPA by SU-AI.ARPA with TCP; 4 Apr 85 13:30:37 PST
Date: Thu 4 Apr 85 15:30:27-CST
From: CL.SHANKAR@UTEXAS-20.ARPA
Subject: Church-Rosser paper
To: JMC@SU-AI.ARPA
cc: cl.shankar@UTEXAS-20.ARPA
I sent you a copy of my tech. report on the mechanical proof of the
Church-Rosser theorem, last week. It wasn't a very good copy, and I
think it had a page missing. I'll mail out a better copy (with all the
pages), to you today.
Shankar
-------
∂04-Apr-85 1358 RA leave early
It's Thursday again and I am leaving early for my class. See you tomorrow.
∂04-Apr-85 1442 GANGOLLI@SU-SCORE.ARPA Reminder/Bert Enderton
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 4 Apr 85 14:41:57 PST
Date: Thu 4 Apr 85 14:41:49-PST
From: Anil Gangolli <GANGOLLI@SU-SCORE.ARPA>
Subject: Reminder/Bert Enderton
To: jmc@SU-SCORE.ARPA
Thank you for responding. I will be bringing Bert Enderton to your office a
1:45pm on Friday. --anil.
-------
∂05-Apr-85 1019 RA income tax return
Your income tax returns are done; you can pick them up at your convenience.
∂05-Apr-85 1337 RA leave early
I am going to leave at 2:15 today for a doctor's appointment. Since
everyone gets to go home at 4:00, I will not be back after the appointment.
Have a nice holiday.
∂05-Apr-85 1401 @SU-CSLI.ARPA:brown@Kestrel Re: Linguistics Drinks Resume Fridays
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 5 Apr 85 14:01:48 PST
Received: from Kestrel.ARPA by SU-CSLI.ARPA with TCP; Fri 5 Apr 85 13:54:36-PST
Received: by Kestrel.ARPA (4.12/4.7)
id AA00264; Fri, 5 Apr 85 11:24:16 pst
Date: Fri, 5 Apr 85 11:24:16 pst
From: brown@Kestrel (Tom Brown)
Message-Id: <8504051924.AA00264@Kestrel.ARPA>
To: BRESNAN@SU-CSLI.ARPA, RAS@SU-CSLI.ARPA, folks@SU-CSLI.ARPA,
friends@SU-CSLI.ARPA, researchers@SU-CSLI.ARPA, visitors@SU-CSLI.ARPA
Subject: Re: Linguistics Drinks Resume Fridays
Are you sure about the R status of this message? --X
∂05-Apr-85 1500 VAL increase in salary at San Jose State
San Jose State University will be increasing the salary of computer science
faculty this spring (because we are "hard-to-hire"). It seems that my salary
will be about 35,500 now, possibly beginning with my next paycheck. I will know
in a couple of weeks what precisely is going to happen. Will you be able to
match this increase?
∂05-Apr-85 1715 YAO@SU-SCORE.ARPA
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 5 Apr 85 17:15:14 PST
Date: Fri 5 Apr 85 17:14:44-PST
From: Andrew Yao <YAO@SU-SCORE.ARPA>
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Fri 5 Apr 85 15:00:00-PST
John, that's a very good letter. Thanks for showing me.
--Andy
-------
∂07-Apr-85 2004 ME NS/AGAIN
∂07-Apr-85 1829 JMC
Is there a way to flush the 64 remembered stories short of logging out?
ME - You mean so that you can seen them again? If so, yes; say ":unseen".
Or you can just say "/AGAIN" (before expr it's sticky, after expr it applies
only to that expression); this let's you see stories again.
∂07-Apr-85 2106 ME NS:UNSEEN
∂07-Apr-85 2030 JMC re: NS/AGAIN
[In reply to message rcvd 07-Apr-85 20:04-PT.]
No, I know about AGAIN. When I have 64 stories, it doesn't remember
new ones I see. I want it to flush its memory and start remembering
stories over again. I will then ask about stories coming in after
some time.
ME - Then use :UNSEEN. That does just what you want, flushes its
memory of stories seen.
∂08-Apr-85 0856 GOLUB@SU-SCORE.ARPA Available computer
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 8 Apr 85 08:53:45 PST
Date: Mon 8 Apr 85 08:53:16-PST
From: Gene Golub <GOLUB@SU-SCORE.ARPA>
Subject: Available computer
To: DISTRIBUTION: ;
John Palmer who received his degree under me is now associated with NCUBE.
They will shortly be introducing a new computer, NCUBE 1 based on the
hypercube architecture. Through a benefactor, the company is interested in
giving us one of their products. John would like to make a presentation
on Monday, April 15 at 10:30 am (or some other convenient time) . The
presentation is confidential. Let me know if you would like to attend.
GENE
-------
∂08-Apr-85 0928 RA David Chudnovsky
Please call David Chudnovsky
(212) 864 5320.
∂08-Apr-85 1016 TULEY@SU-SCORE.ARPA message
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 8 Apr 85 10:15:51 PST
Date: Mon 8 Apr 85 10:15:39-PST
From: Kimberly Tuley <TULEY@SU-SCORE.ARPA>
Subject: message
To: jmc@SU-AI.ARPA
cc: ra@SU-AI.ARPA
Hello,
Culbert Hurd would like you to call him. 854-1900.
thanks, Kim
-------
∂08-Apr-85 1026 VAL Circumscription Seminar
To: "@CS.DST[1,VAL]"@SU-AI.ARPA
On April 3, Kurt Konolige will speak about the model theory of circumscription
(2:00, MJH 301). The abstract follows.
--vl
ABSTRACT OF NEXT SEMINAR
The model theory of circumscription is based on the concept of a minimal model,
for which the second-order formalization is sound and complete. I want to look
at the following topics.
(a) The (non)-interaction of circumscription and equality.
(b) What happens when there are no minimal models, or minimal
models only partially cover the class of models of a theory.
(c) Incompleteness of the schematic form of circumscription.
Relevant papers are Mercer, Etherington, and Reiter in the Nonmon
workshop proceedings, and Minker and Perlis' recent AI journal
submission.
--kk
∂08-Apr-85 1029 VAL Circumscription seminar
To: "@CS.DST[1,VAL]"@SU-AI.ARPA
Correction: the date of the next seminar is, of course, April 10.
∂08-Apr-85 1109 ashok@diablo Faculty search folders
Received: from SU-AIMVAX.ARPA by SU-AI.ARPA with TCP; 8 Apr 85 11:09:13 PST
Date: Mon, 8 Apr 85 11:09:37 pst
From: Ashok Subramanian <ashok@diablo>
Subject: Faculty search folders
To: jmc@sail
When could I come pick the folders up from you ? Professors Yao and
Papadimitriou do not wish to see them until tommorrow at the meeting, and Dave
Smith does not wish to see them either.
ashok
∂08-Apr-85 1428 VAL Circumscription Seminar
To: "@CS.DST[1,VAL]"@SU-AI.ARPA
Kurt Konolige's talk is postponed until April 17. No seminar this week.
∂08-Apr-85 1541 BSCOTT@SU-SCORE.ARPA Research Associate Salaries
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 8 Apr 85 15:41:19 PST
Date: Mon 8 Apr 85 15:36:15-PST
From: Betty Scott <BSCOTT@SU-SCORE.ARPA>
Subject: Research Associate Salaries
To: JMC@SU-AI.ARPA
cc: BScott@SU-SCORE.ARPA
You have only two research associates, Jussi and Les. Since Jussi will
be back in the fall, we have to make a recommendation concerning his salary.
KSL (HPP) recommended an across-the-board salary increase of l0% for all
their research associates. Does this sound reasonable to you for Jussi?
It would bring his salary to $53,480 for 85-86.
With regard to Les, maybe you want to leave his salary at the $67,500,
and allow for a mid-year increase?
Les said he doesn't know Jussi that well, and can't make a recommendation on
his salary.
Thanks,
Betty
-------
∂08-Apr-85 1624 avg@diablo coloring I
Received: from SU-AIMVAX.ARPA by SU-AI.ARPA with TCP; 8 Apr 85 16:21:19 PST
Date: Mon, 8 Apr 85 16:21:44 pst
From: Allen VanGelder <avg@diablo>
Subject: coloring I
To: jmc@sail
I tried Shapiro's program on C Prolog, and it got many solutions. I.e.,
it did not go into a left recursion loop. The exact file, which should
work as is on sail, is in the "coloring II" message. You will note that
it has been edited for readability. I am curious if it runs out of
stack space on trying to get a second solution on sail. Recall that
semi-colon asks for Additional solutions after the first is found.
∂08-Apr-85 1624 avg@diablo coloring II
Received: from SU-AIMVAX.ARPA by SU-AI.ARPA with TCP; 8 Apr 85 16:21:47 PST
Date: Mon, 8 Apr 85 16:22:15 pst
From: Allen VanGelder <avg@diablo>
Subject: coloring II
To: jmc@sail
/*
The program defines the relation color(Map, Colors),
between a map and a list of colors, which is true if Map
is legally colored using Colors.
-- Ehud Shapiro
A map is represented using adjacency-lists, where with
each country we associate its color, and the list of
colors of its neighbours. If the program is used in
generate-mode, i.e. to color an uncolored map, these
colors would be uninstantiated variables. The program
would then compute all possible colorings. For example,
the uncolored map
←←←←←←←←←←
| a |
|←←←←←←←←|
|b |c |d |
|←←|←←|←←|
|e |f |
|←←←|←←←←|
is represented by the term:
*/
map( [country(a, A, [B, C, D]),
country(b, B, [A, C, E]),
country(c, C, [A, B, D, E, F]),
country(d, D, [A, B, F]),
country(e, E, [B, C, F]),
country(f, F, [C, D, E])
]
).
color←map([Country | Map], Colors) :-
color←country(Country, Colors),
color←map(Map, Colors).
color←map([], ←Colors).
color←country(country(←Name, C, AdjacentCs), Colors) :-
remove(C, Colors, Colors1),
subset(AdjacentCs, Colors1).
subset([C | Cs], Colors) :-
remove(C, Colors, ←),
subset(Cs, Colors).
subset([], ←Colors).
remove(C, [C | Cs], Cs).
remove(C, [C1 | Cs], [C1 | Cs1]) :-
remove(C, Cs, Cs1).
colors([red, green, blue, white]).
test(Map) :-
map(Map),
colors(Colors),
color←map(Map, Colors).
∂08-Apr-85 1653 avg@diablo coloring III
Received: from SU-AIMVAX.ARPA by SU-AI.ARPA with TCP; 8 Apr 85 16:53:08 PST
Date: Mon, 8 Apr 85 16:53:35 pst
From: Allen VanGelder <avg@diablo>
Subject: coloring III
To: jmc@sail
The file in the message "coloring IV" has an added rule for color←map
that applies the postponement heuristic, plus rules for the new
predicate easy←country that selects a country with < 4 neighbors if
possible. It seems to work.
∂08-Apr-85 1655 RA George Danzig
Please call GBD either at his office 7-1304, or at home 493 0578.
∂08-Apr-85 1655 avg@diablo coloring IV
Received: from SU-AIMVAX.ARPA by SU-AI.ARPA with TCP; 8 Apr 85 16:55:35 PST
Date: Mon, 8 Apr 85 16:56:01 pst
From: Allen VanGelder <avg@diablo>
Subject: coloring IV
To: jmc@sail
/*
The program defines the relation color(Map, Colors),
between a map and a list of colors, which is true if Map
is legally colored using Colors.
-- Ehud Shapiro
Postponement heuristic added -- A.V.G.
A map is represented using adjacency-lists, where with
each country we associate its color, and the list of
colors of its neighbours. If the program is used in
generate-mode, i.e. to color an uncolored map, these
colors would be uninstantiated variables. The program
would then compute all possible colorings. For example,
the uncolored map
←←←←←←←←←←
| a |
|←←←←←←←←|
|b |c |d |
|←←|←←|←←|
|e |f |
|←←←|←←←←|
is represented by the term:
*/
map( [country(a, A, [B, C, D]),
country(b, B, [A, C, E]),
country(c, C, [A, B, D, E, F]),
country(d, D, [A, B, F]),
country(e, E, [B, C, F]),
country(f, F, [C, D, E])
]
).
color←map([], ←Colors).
color←map(Map, Colors) :-
easy←country(Map, Country, Map1),
!, % Require use of easy←country when possible (optinal cut)
color←map(Map1, Colors),
color←country(Country, Colors).
color←map([Country | Map], Colors) :-
color←country(Country, Colors),
color←map(Map, Colors).
color←country(country(←Name, C, AdjacentCs), Colors) :-
remove(C, Colors, Colors1),
subset(AdjacentCs, Colors1).
easy←country([Country | Map], Country, Map) :-
Country = country(←Name, C, AdjacentCs),
length(AdjacentCs, N),
N < 4.
easy←country([Country | Map], Country1, [Country | Map1]) :-
Country = country(←Name, C, AdjacentCs),
length(AdjacentCs, N),
N >= 4,
easy←country(Map, Country1, Map1).
subset([], ←Colors).
subset([C | Cs], Colors) :-
remove(C, Colors, ←),
subset(Cs, Colors).
remove(C, [C | Cs], Cs).
remove(C, [C1 | Cs], [C1 | Cs1]) :-
remove(C, Cs, Cs1).
colors([red, green, blue, white]).
test(Map) :-
map(Map),
colors(Colors),
color←map(Map, Colors).
∂08-Apr-85 1700 avg@diablo coloring V
Received: from SU-AIMVAX.ARPA by SU-AI.ARPA with TCP; 8 Apr 85 17:00:49 PST
Date: Mon, 8 Apr 85 17:01:08 pst
From: Allen VanGelder <avg@diablo>
Subject: coloring V
To: jmc@sail
The file in coloring IV is intended to give the least perturbation
solution to incorporating the postponement heuristic. The final
result does not represent good programming style in my opinion.
If you get a coloring VI message, it will be my idea of the program done
in correct style. I haven't done it yet though.
Now I remember that the text last Fall time was issued in two installments.
There were three new chapters and the rest were taken from the old
version. Anyway I'd like to give Eric Muller a free one.
∂08-Apr-85 1729 EM@SU-SCORE.ARPA Lisp programming and proving.
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 8 Apr 85 17:29:47 PST
Date: Mon 8 Apr 85 17:12:50-PST
From: Eric Muller <EM@SU-SCORE.ARPA>
Subject: Lisp programming and proving.
To: jmc@SU-AI.ARPA
Hello,
Where can I buy a copy of the CS206 textbook, "lisp programming and proving" ?
I did not bring my copy back with me and it turns out to be a
mistake.
thanks.
eric.
-------
∂08-Apr-85 1736 avg@diablo coloring V-a
Received: from SU-AIMVAX.ARPA by SU-AI.ARPA with TCP; 8 Apr 85 17:36:17 PST
Date: Mon, 8 Apr 85 17:36:39 pst
From: Allen VanGelder <avg@diablo>
Subject: coloring V-a
To: jmc@sail
The file in coloring VI is the one promised earlier. It is a little
awkward because I wanted to avoid Prolog's "or via semi-colon" and
stick to pure clause form. Compared to the earlier version that has
postponement, in this version easy←country always succeeds, but its last
argument is "no" if there is no easy country left. Then
color←map←choose switches to color←map←brute instead of recurring on
color←map.
The program worked on the one map furnished.
∂08-Apr-85 1737 avg@diablo coloring VI
Received: from SU-AIMVAX.ARPA by SU-AI.ARPA with TCP; 8 Apr 85 17:36:49 PST
Date: Mon, 8 Apr 85 17:37:12 pst
From: Allen VanGelder <avg@diablo>
Subject: coloring VI
To: jmc@sail
/*
The program defines the relation color(Map, Colors),
between a map and a list of colors, which is true if Map
is legally colored using Colors.
-- Ehud Shapiro
Postponement heuristic added.
Recoded to use guards instead of cuts to eliminate redundant solns.
-- A.V.G.
A map is represented using adjacency-lists, where with
each country we associate its color, and the list of
colors of its neighbours. If the program is used in
generate-mode, i.e. to color an uncolored map, these
colors would be uninstantiated variables. The program
would then compute all possible colorings. For example,
the uncolored map
←←←←←←←←←←
| a |
|←←←←←←←←|
|b |c |d |
|←←|←←|←←|
|e |f |
|←←←|←←←←|
is represented by the term:
*/
map( [country(a, A, [B, C, D]),
country(b, B, [A, C, E]),
country(c, C, [A, B, D, E, F]),
country(d, D, [A, B, F]),
country(e, E, [B, C, F]),
country(f, F, [C, D, E])
]
).
color←map([], ←Colors).
color←map(Map, Colors) :-
easy←country(Map, Country, Map1, Easy),
color←map←choose(Country, Map1, Easy, Colors).
color←map←choose(Country, Map, yes, Colors) :-
color←map(Map, Colors),
color←country(Country, Colors).
color←map←choose(Country, Map, no, Colors) :-
color←map←brute([Country | Map], Colors).
color←map←brute([], ←Colors).
color←map←brute([Country | Map], Colors) :-
color←country(Country, Colors),
color←map←brute(Map, Colors).
color←country(country(←Name, C, AdjacentCs), Colors) :-
remove(C, Colors, Colors1),
subset(AdjacentCs, Colors1).
easy←country([Country | Map], Country, Map, yes) :-
Country = country(←Name, C, AdjacentCs),
length(AdjacentCs, N),
N < 4.
easy←country([Country], Country, [], no) :-
Country = country(←Name, C, AdjacentCs),
length(AdjacentCs, N),
N >= 4.
easy←country([Country | Map], Country1, [Country | Map1], Easy) :-
Country = country(←Name, C, AdjacentCs),
length(AdjacentCs, N),
N >= 4,
easy←country(Map, Country1, Map1, Easy).
subset([], ←Colors).
subset([C | Cs], Colors) :-
remove(C, Colors, ←),
subset(Cs, Colors).
remove(C, [C | Cs], Cs).
remove(C, [C1 | Cs], [C1 | Cs1]) :-
remove(C, Cs, Cs1).
colors([red, green, blue, white]).
test(Map) :-
map(Map),
colors(Colors),
color←map(Map, Colors).
∂08-Apr-85 1746 JOHN@SU-CSLI.ARPA Meeting
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 8 Apr 85 17:45:49 PST
Date: Mon 8 Apr 85 17:45:12-PST
From: John Perry <JOHN@SU-CSLI.ARPA>
Subject: Meeting
To: Initiators@SU-CSLI.ARPA
Eric Ostrom has resigned as Director of Computing. I am having a meeting
with the Computing Committee on Thursday, April 11, 8:30, in the Ventura
Conference Room to discuss this development as well as a report I have
received from Daniel Sagalowicz concerning our computing environment.
Other initiators who are interested in these developments are welcome
to attend.
John.
-------
∂08-Apr-85 1920 avg@diablo re: Self-Modifying Code Survey (from SAIL's BBOARD)
Received: from SU-AIMVAX.ARPA by SU-AI.ARPA with TCP; 8 Apr 85 19:20:46 PST
Date: Mon, 8 Apr 85 19:21:16 pst
From: Allen VanGelder <avg@diablo>
Subject: re: Self-Modifying Code Survey (from SAIL's BBOARD)
To: JMC@Sail, su-bboards@diablo
JMC's hack on ARRAY looks like the forerunner of UUO-LINKS in
Maclisp. Come to think of it, UUO-LINKS comes pretty close to
self-modifying code, and has many of the same drawbacks.
∂08-Apr-85 2021 VGA avoiding space problems in prolog
Apparently the Prolog compiler does better with space. My files in [1,VGA]
can be examined and copied. prolog.ini is a souped-up version of FY's that
has a compile macro. color.pl is coloring II" with some changes to make it
compilable. The beginning comment should be self-explanatory. That comment
and the "public" lines after it an be opied to other coloring files and
should be sufficient to make them compilable.
This should also help to avoid running out of space before getting to the
first solution on somewhat larger problems.
∂09-Apr-85 0826 RA Re: Lisp programming and proving.
[Reply to message recvd: 08 Apr 85 17:32-PST]
You can come to my office and make yourself a copy of it.
Rutie
-----
∂09-Apr-85 0827 RA wrong message
The message I just sent you was intended for Eric Muler. Just ignore it.
Sorry.
∂09-Apr-85 0900 JMC*
brag for George Dantzig
∂09-Apr-85 0948 RA AI book
Dorothy Patent wrote a book about AI which will be published by Harcourt
and Brace. The audience is highschool students. She would like to include
a photograph she has of you in the book, and is asking you permission to
do so. She will call back tomorrow; what shall I tell her?
∂09-Apr-85 1214 RA go out
I went to the bookstore and post office; will be back in about an hour.
∂09-Apr-85 1228 avg@diablo Re: doubt
Received: from SU-AIMVAX.ARPA by SU-AI.ARPA with TCP; 9 Apr 85 12:27:20 PST
Date: Tue, 9 Apr 85 12:27:51 pst
From: Allen VanGelder <avg@diablo>
Subject: Re: doubt
To: JMC@SU-AI.ARPA
I intended that easy←country succeed if ANY country in the list is easy,
not just if the first one is easy. Thus if b and d are easy in
map [a, b, c, d, e], the sequence of subgoals should be something like this:
color←map [a, b, c, d, e].
color←map [a, c, d, e], color←cty b.
color←map [a, c, e], color←cty d, color←cty b.
color←map←brute [e, a, c], color←cty d, color←cty b.
* color←cty e, color←cty a, color←cty c, color←cty d, color←cty b.
with liberal abuse of notation and some steps omitted. The starred line
does not exist all at once, but does reflect the final order in which
countries are colored.
If it does not work this way, it can be fixed to do so.
Color IV and Color VI were supposed to do ALMOST the same thing.
However, the simpler Color IV eventually reduces to the more natural order
on the brute-force portion:
* color←cty a, color←cty c, color←cty e, color←cty d, color←cty b.
∂09-Apr-85 1253 LAURENCE@SU-CSLI.ARPA re: Self-Modifying Code Survey (from SAIL's BBOARD)
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 9 Apr 85 12:53:42 PST
Date: Tue 9 Apr 85 12:53:15-PST
From: Laurence R Brothers <LAURENCE@SU-CSLI.ARPA>
Subject: re: Self-Modifying Code Survey (from SAIL's BBOARD)
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Mon 8 Apr 85 17:16:00-PST
I would like a sushi account. Actually, I really don't deserve one except
as a grader for cs107, which is kind of like being a ta, which I was last
quarter and the quarter before that, anyhow.
-Laurence
-------
∂09-Apr-85 1254 LAURENCE@SU-CSLI.ARPA re: Self-Modifying Code Survey (from SAIL's BBOARD)
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 9 Apr 85 12:54:29 PST
Date: Tue 9 Apr 85 12:54:02-PST
From: Laurence R Brothers <LAURENCE@SU-CSLI.ARPA>
Subject: re: Self-Modifying Code Survey (from SAIL's BBOARD)
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Mon 8 Apr 85 17:16:00-PST
oops, I messed up, I'm afraid. That was supposed to go to stuart. I'm sorry
for the confusion.
-Laurence
-------
∂09-Apr-85 1338 RA interview
Abigail Christopher from Computer Graphics World would like to ask you some
questions about LISP and PROLOG. Her # (57) 398 7151. She'll call back later
this afternoon.
∂09-Apr-85 1604 PETERS@SU-CSLI.ARPA Thanks
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 9 Apr 85 16:04:21 PST
Date: Tue 9 Apr 85 16:03:45-PST
From: Stanley Peters <PETERS@SU-CSLI.ARPA>
Subject: Thanks
To: jmc@SU-AI.ARPA
John,
Thanks for the prose. It seems right on the mark to me. I'll
be looking forward to talking further about the situation over
lunch with you next Tuesday.
Stanley
-------
∂09-Apr-85 1604 YAO@SU-SCORE.ARPA search committee meeting
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 9 Apr 85 16:04:46 PST
Date: Tue 9 Apr 85 15:47:15-PST
From: Andrew Yao <YAO@SU-SCORE.ARPA>
Subject: search committee meeting
To: Nilsson@SU-SCORE.ARPA
cc: Yao@SU-SCORE.ARPA, Papa@SU-SCORE.ARPA, JMC@SU-AI.ARPA, Ashok@SU-SCORE.ARPA
Nils, in today's meeting, we have narrowed the list of candidates who
have applied to eight, plus a number of logic programming people who
John is going to send his letter to. There are eight or nine folders
that we think would be more appropriate for the system search committee
to consider, and I will give them to you after you return from the trip.
In particular, Jeannette Wing seems to be strong, and the system committee
might wish to pay special attention to. Also, among the names you mentioned,
John Hopcroft has been working in robotics in the last few years, and we
feel that the search committee on robotics might be interested in considering
him.
We will have a third meeting after John hears the response from the
persons that he writes to; so that will be three or four weeks away from
now.
--Andy
-------
∂09-Apr-85 1607 YAO@SU-SCORE.ARPA re:previous message
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 9 Apr 85 16:06:58 PST
Date: Tue 9 Apr 85 15:59:01-PST
From: Andrew Yao <YAO@SU-SCORE.ARPA>
Subject: re:previous message
To: Nilsson@SU-SCORE.ARPA
cc: Yao@SU-SCORE.ARPA, Papa@SU-SCORE.ARPA, JMC@SU-AI.ARPA, Ashok@SU-SCORE.ARPA
Nils, I forgot to mention that we think Lamport should be considered by
the system search committee.
--Andy
-------
∂09-Apr-85 1704 RA Yoram Moses orals
Yoram was interested in scheduling his orals on May 31. Your schedule
indicates that you will be in LA for AAAS from May 26 to May 31. Do you
expect to be back by noon on the 31st? Please let me know.
Rutie
-----
∂09-Apr-85 1728 @SU-CSLI.ARPA:CLT@SU-AI.ARPA Seminar in Logic and Foundations of Mathematics
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 9 Apr 85 17:25:44 PST
Received: from SU-AI.ARPA by SU-CSLI.ARPA with TCP; Tue 9 Apr 85 17:23:49-PST
Date: 09 Apr 85 1715 PST
From: Carolyn Talcott <CLT@SU-AI.ARPA>
Subject: Seminar in Logic and Foundations of Mathematics
To: "@DIS.DIS[1,CLT]"@SU-AI.ARPA
Speaker: Prof. Jon Barwise
Title: On the model theory of shared information
Time: Tuesday, April 16, 1985 at 4:15-5:30 P.M.
Place: Room 381-T, Math Corner, Stanford
Abstract:
The traditional model-theoretic approach to the problem of
shared understanding (public information, common knowledge, mutual
belief) has been through an iterated hierarchy of attitude reports (c
knows that b knows ... that c knows that P), mirroring the iterated
hierarchy in set theory and higher-order model theory. In this talk I
want to show that Aczel's work on non-wellfounded sets gives us a new
tool for a "direct" model-theoretic approach through situations. I
will go on to state some approximation theorems that show to what
extent the hierarchy approach does and does not add up, in the limit,
to the direct approach. The results raise a number of interesting
model-theoretic questions that only arise in the context of
non-wellfounded sets.
S. Feferman
∂09-Apr-85 1811 RESTIVO@SU-SCORE.ARPA re: Self-Modifying Code Survey (from SAIL's BBOARD)
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 9 Apr 85 18:11:39 PST
Date: Tue 9 Apr 85 18:11:14-PST
From: Chuck Restivo <RESTIVO@SU-SCORE.ARPA>
Subject: re: Self-Modifying Code Survey (from SAIL's BBOARD)
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Tue 9 Apr 85 17:35:00-PST
[cwr] could I be a PhD exam candidate if I choose to program a bubble sort
on the CDC 6600?
-------
∂09-Apr-85 1856 MRC@SU-SCORE.ARPA self-modifying
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 9 Apr 85 18:56:43 PST
Date: Tue 9 Apr 85 18:56:34-PST
From: Mark Crispin <MRC@SU-SCORE.ARPA>
Subject: self-modifying
To: JMC@SU-AI.ARPA
Postal-Address: 725 Mariposa Ave. #103; Mountain View, CA 94041-1869
Phone: 1 (415) 968-1052
It isn't often we are in agreement in BBoard flames. I am pleased
that you understood what it was that I was saying (the "too dumb") comment
and agreed with me. I think it is a sign of professionalism that one is
willing to learn and try new things. My main reason in fact for disliking
Unix is that Unix tends to lend itself to a "groupieism" which excludes
all other models of computation.
-------
∂09-Apr-85 2032 VGA Prolog magic
Shapiro's program is meta-inefficient in the way it instantiates colors
via unbound arguments of subset. We really only want to check that the
adjacent countries whose colors have been chosen do not conflict with the
current choice. A one-line fix to the subset procedure using \+ \+
does the trick. See color.pl[1,VGA]. You will see a line
\+ \+ remove(...),
where there used to be just
remove(...),
This enables the program to find all 120 colorings without running out of
space. The same fix should be put in all versions, or the heuristics have
no effect, because it blindly instantiates all countries colors in the
course of satisfying one "subset" subgoal.
Also, there is a typo in map. Country D should be adjacent to [A, C, F],
not to [A, B, F].
Recall that \+ loosely means "not provable" in prolog. \+ \+ is double
negation. If remove(...) can succeed, then \+ \+ remove(...) will also
succeed once but will not do any bindings.
Finally, I checked over my code for Color VI and it does indeed postpone
countries a, b, d, e, f, but not c. I verified this using trace.
∂09-Apr-85 2121 EM@SU-SCORE.ARPA Lisp programming and proving.
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 9 Apr 85 21:21:33 PST
Date: Tue 9 Apr 85 21:21:07-PST
From: Eric Muller <EM@SU-SCORE.ARPA>
Subject: Lisp programming and proving.
To: jmc@SU-AI.ARPA
thank you very much.
eric.
-------
∂10-Apr-85 0053 REGES@SU-SCORE.ARPA SUSHI
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 10 Apr 85 00:53:34 PST
Date: Wed 10 Apr 85 00:53:17-PST
From: Stuart Reges <REGES@SU-SCORE.ARPA>
Subject: SUSHI
To: jmc@SU-AI.ARPA
Office: Margaret Jacks 210, 497-9798
Do you really want a SUSHI account?
-------
∂10-Apr-85 1436 @SU-SCORE.ARPA:bellcore!walker@Berkeley invitation to an AI Conference in Singapore
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 10 Apr 85 14:36:18 PST
Received: from UCB-VAX.ARPA by SU-SCORE.ARPA with TCP; Wed 10 Apr 85 14:35:48-PST
Received: by UCB-VAX.ARPA (4.24/4.45)
id AA22745; Wed, 10 Apr 85 14:34:46 pst
Received: by mouton.UUCP (4.12/4.7)
id AA04638; Wed, 10 Apr 85 11:19:14 est
Date: Wed, 10 Apr 85 11:19:14 est
From: bellcore!walker@Berkeley (Don Walker)
Message-Id: <8504101619.AA04638@mouton.UUCP>
To: jmc@su-score.ARPA
Subject: invitation to an AI Conference in Singapore
Cc: ~/msg@Berkeley
John,
I would like you to join me on the program of Artificial Intelligence
'86 which will take place at the Hyatt Regency in Singapore from 24-27
March 1986. The Conference is sponsored by the Singapore Science
Council and cosponsored by their National Computer Board, the National
University of Singapore, the Institute of Systems Science, and the
Singapore Economic Development Board. The theme is AI and Its
Application, A State-of-the-Art View, and I am trying to pack the
program with the best from the US, Europe, and Japan. Reind van der
Riet of the Free University in Amsterdam is coordinating for Europe;
Hideo Aiso of Keio University in Yokohama for Japan; and Bernard Tan
of the National University of Singapore is supporting me locally.
The objective of the Singaporeans is to make AI meaningful for their
region. They will provide air fare, hotel accommodations, and an
honorarium of $150 per day for speakers (an hour talk) and $250 for
a tutorial session (about two hours plus discussions); a person could
do both. I should add that most of the meals will be provided by
the sponsors. The rewards are clearly not financial; I see them
more in providing a panorama of AI in an exotic setting. While
most of the audience will not be engaged in AI research themselves
(although it could attract more people from outside Southeast Asia
than I think likely), they will be competent scientists and engineers
with a keen interest in the field. There is an opportunity for
embodying the results in a book that lays out the field for a general
audience, but I won't levy that as a condition for participation;
that can be considered later.
As you can appreciate, it has taken some time to get organized at
the ground level. I am now trying to build the superstructure.
We would like to get a program out quite soon, so I would appreciate
an early response.
Don
bellcore!walker@berkeley (lower case; the part before the @ sign has
to be quoted from some Tops-20 systems)
∂10-Apr-85 1620 VARDI@SU-CSLI.ARPA [djl%brandeis.csnet@csnet-relay.arpa: Re: Interests]
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 10 Apr 85 16:20:33 PST
Date: Wed 10 Apr 85 16:19:44-PST
From: Moshe Y. Vardi <VARDI@SU-CSLI.ARPA>
Subject: [djl%brandeis.csnet@csnet-relay.arpa: Re: Interests]
To: barwise@SU-CSLI.ARPA, jmc@SU-AI.ARPA, stan@SRI-AI.ARPA, bmoore@SRI-AI.ARPA,
israel@SRI-AI.ARPA, goguen@SRI-AI.ARPA
Here is the message I got from Danny Lehman regarding his interest. At some
point in the near future I'd like to give him a definite answer regarding
financial support for his visit. Is anyone on the address list willing to
support Danny's visit?
Moshe
---------------
Return-Path: <djl%brandeis.csnet@csnet-relay.arpa>
Received: from csnet-relay by SU-CSLI.ARPA with TCP; Tue 9 Apr 85 08:25:23-PST
Received: from brandeis by csnet-relay.csnet id aa01715; 9 Apr 85 11:21 EST
Received: by brandeis.ARPA (4.12/4.7)
id AA00602; Tue, 9 Apr 85 09:47:48 est
Date: 9 Apr 1985 09:37-EST
From: djl%brandeis.csnet@csnet-relay.arpa
In-Real-Life: Daniel Lehmann,faculty
Subject: Re: Interests
To: vardi@su-csli.ARPA
Message-Id: <481905447/djl@brandeis>
In-Reply-To: "Moshe Y. Vardi"'s message of Fri 5 Apr 85 153339-PST
I find now your second message.
I am interested in logics of programs and applications of modal logics
to A.I., in probabilistic algorithms for distributed systems and their
proofs of correctness.
I could talk on either or both of the two subjects below, or, if there
is interest, on a probabilistic solution to the mutual exclusion problem
(joint work with S. Cohen and A. Pnueli). The paper just appeared in
TCS.
Knowledge, Common Knowledge and some puzzles
Daniel Lehmann
Brandeis University
( on sabbatical leave from Hebrew University)
Abstract
In a distributed system, each processor has only a partial view of the
history of the whole system, namely the messages it receives. System
designers and system analysts often use a "knowledge" metaphor to talk
about such distributed systems, as if a processor knew certain facts about
the whole system and did not know some other facts. They often use
delicate reasoning about the knowledge (or the absence of it) that some
parts may have about the state of the whole system, including knowledge
possessed by other parts. In most cases the evolution of such knowledge
with time must be considered. A formal system in which one can describe
situations (real-life or programs) involving knowledge, common knowledge
and time will be discussed. A well-known puzzle will be analyzed formally
in this system.
Modal Temporal Logics: a survey of recent results
Daniel Lehmann
Hebrew University (visiting Brandeis University)
Abstract
In a joint work with S. Shelah, some extensions of the propositional temporal
logic of discrete time were advocated as useful for stating and proving
properties of probabilistic concurrent programs. Deductive completeness
theorems were proved. In a joint work with S. Kraus corresponding decision
procedures were investigated. Recently a system for describing time and
knowledge has been proposed. All those systems can be characterized as
two-dimensional modal logics, i.e. they involve two essentially orthogonal
modalities, one of them being time, that satisfy some interchange law.
The techniques involved in studying such systems and some open problems will
be described.
-------
∂10-Apr-85 1947 CLT ira etc.
did you send a check to cate? or should i?
did you check with him that all is set?
∂11-Apr-85 0956 joanna@Krakatoa Discussions with Peter Will and Mark Raibert
Received: from KRAKATOA by SU-AI.ARPA with TCP; 11 Apr 85 09:56:27 PST
Date: Thu, 11 Apr 85 09:56:26 pst
From: Joanna Golden <joanna@Krakatoa>
Subject: Discussions with Peter Will and Mark Raibert
To: JMC@SU-AI.ARPA, NILSSON@SU-SCORE.ARPA, REYNOLDS@SU-SCORE.ARPA,
TOB@SU-AI.ARPA, bscott@SU-SCORE.ARPA
Talked with both Will and Raibert on April 8th.
Will seemed quite interested in learning more about the Professor (Research)
position as we have been using it at Stanford, and agreed to visit with us
sometime between April 20th and May 20th, with the week of April 22nd looking
likely. I guess we can figure out whether a seminar is possible after we
know when he's coming. I told him we had decided to try to bring in two
strong senior people, one to be laboratory and program leader and the other
in the more conventional academic professor role. I described the aero-
relativity satellite project and the way we are using the position Professor
(Research) to provide leadership there, where the Professor (Research) title
is more appropriate and where the emphasis is on the candidate's management
background more heavily, and less heavily on scholarly works.
I spent quite a bit of time with Peter discussing candidates for the other,
academic position. He comes out high on four people: Raibert, Russel Taylor,
Lavin (of MIT), and Matt Mason. He said Raibert and Taylor are entirely
complementary, Raibert as a robot control strategist, Taylor as a programming
wizard ("a bit eccentric, but you're glad to take that with brilliance of
this level"). Lavin he rates as a third "highly skilled professional person."
Mason is much younger but very good. Peter Will does not consider Inoue as
good as Raibert. ("Less innovative.")
Mark Raibert's situation is that he must make the basic decision whether to stay
at CMU or not. They have given him a big lab, very little teaching, and about
everything he needs. Also, the Raiberts are beginning to feel the fact that
their families are in the east. (He commentated that Cedar Hall would be quite
unsuitable for his work.) I asked whether he would continue to pursue legged
locomotion, and he said he thought there were several more good years in it, but
he realized he needs to develop another direction in parallel.
Mark would not quite yet like to make his application formal, until he makes the
main decision. We left it that I will let him know how rapidly things are
developing, so that he has enough opportunity to become a formal applicant
before he misses out. He seemed quite pleased with this. --- Bob Cannon.
∂11-Apr-85 1115 GOLUB@SU-SCORE.ARPA [Gene Golub <GOLUB@SU-SCORE.ARPA>: Available computer]
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 11 Apr 85 11:14:47 PST
Date: Thu 11 Apr 85 11:02:11-PST
From: Gene Golub <GOLUB@SU-SCORE.ARPA>
Subject: [Gene Golub <GOLUB@SU-SCORE.ARPA>: Available computer]
To: DISTRIBUTION: ;
The presentation will take place on Monday at 10:30 in MJH 301.
GENE
---------------
Date: Mon 8 Apr 85 08:53:16-PST
From: Gene Golub <GOLUB@SU-SCORE.ARPA>
Subject: Available computer
To: DISTRIBUTION: ;
John Palmer who received his degree under me is now associated with NCUBE.
They will shortly be introducing a new computer, NCUBE 1 based on the
hypercube architecture. Through a benefactor, the company is interested in
giving us one of their products. John would like to make a presentation
on Monday, April 15 at 10:30 am (or some other convenient time) . The
presentation is confidential. Let me know if you would like to attend.
GENE
-------
-------
∂11-Apr-85 1150 RA Monday date
I sat a date for you for Monday with Prof. Harari (Zohar's visitor from
Weizmann Institute). If this is inconvenient please let me know. Thanks.
∂11-Apr-85 1403 SJG lunch with my mom?
Dear John:
Sorry to have taken so long to get back to you; I have some immovable
commitments for Saturday afternoon, and had to find out about them.
If you get this note in time, I need to be in Mountain View at 11.30 on
Saturday, which may, I fear, be too early for us all o have lunch together.
If not, send me a message or come and find me ...
Thanks. Sorry again about the delay --
Matt
∂11-Apr-85 1436 SJG mom's visit
To: JMC@SU-AI.ARPA, shayer@PSYCH
cancelled. She's pretty sick. More later. Matt
∂11-Apr-85 1455 VARDI@SU-CSLI.ARPA
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 11 Apr 85 14:55:24 PST
Date: Thu 11 Apr 85 14:55:29-PST
From: Moshe Y. Vardi <VARDI@SU-CSLI.ARPA>
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Thu 11 Apr 85 08:20:00-PST
Fair enough.
Moshe
-------
∂12-Apr-85 0928 RA Stanford AI specific projects
Peri Ktonas from the EE Dept. at The Univ. of Houston (713) 749 2452 called re
specific projects the AI group is working on.
∂12-Apr-85 1005 Bobrow.pa@Xerox.ARPA Re: Copyright Permission
Received: from XEROX.ARPA by SU-AI.ARPA with TCP; 12 Apr 85 10:05:41 PST
Received: from Semillon.ms by ArpaGateway.ms ; 12 APR 85 10:01:43 PST
Date: 12 Apr 85 10:01 PST
From: Bobrow.pa@Xerox.ARPA
Subject: Re: Copyright Permission
In-reply-to: AAAI <AAAI-OFFICE@SUMEX-AIM.ARPA>'s message of Fri, 29 Mar
85 14:29:46 PST
To: AAAI-OFFICE@SUMEX-AIM.ARPA
cc: Lerman@SRI-KL.ARPA, Engelmore@SUMEX-AIM.ARPA, Nilsson@SU-SCORE.ARPA,
JMC@SU-AI.ARPA, Bobrow.PA@Xerox.ARPA, AI.Woody@MCC.ARPA
The AI Journal has a policy of granting reprint permission to the author
(and anyone he or she delegates) for the acknowledgement. Do we need
more? I would think that our goal is to promulgate information, and
publicity that we do so (the acknowledgement) is sufficient payment.
danny
∂12-Apr-85 1359 berglund@Pescadero Max Hailperin
Received: from SU-PESCADERO.ARPA by SU-AI.ARPA with TCP; 12 Apr 85 13:58:24 PST
Date: Fri, 12 Apr 85 13:58:00 pst
From: Eric Berglund <berglund@Pescadero>
Subject: Max Hailperin
To: jmc@sail
Is one of our top-rated admittees to the Ph.D. program. He's trying to
decide whether to come here or to stay at MIT. He'll be visiting the
25th and 26th of this month and would like to meet with you. Do you
have time to talk with him while he's here?
--Eric
∂12-Apr-85 1709 RA Symposium on AI at XEROX
Juliana Lavendel, Manager of Information resources at Xerox, PA called
re symposium on AI and libraries. (415) 494 4040.
∂13-Apr-85 1051 GANGOLLI@SU-SCORE.ARPA Tom Strat
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 13 Apr 85 10:51:22 PST
Date: Sat 13 Apr 85 10:51:09-PST
From: Anil Gangolli <GANGOLLI@SU-SCORE.ARPA>
Subject: Tom Strat
To: jmc@SU-AI.ARPA
cc: GANGOLLI@SU-SCORE.ARPA
Tom Strat, a newly admitted PhD student, would like to meet with you
sometime in the next week or two. He is at SRI now, so we have some
flexibility in when we arrange this. Mondays and Wednesdays are
good for him. Please suggest a convenient time. Thanks. --anil.
-------
∂14-Apr-85 1915 CL.BOYER@UTEXAS-20.ARPA
Received: from UTEXAS-20.ARPA by SU-AI.ARPA with TCP; 14 Apr 85 19:15:49 PST
Date: Sun, 14 Apr 1985 21:07 CST
From: CL.BOYER@UTEXAS-20.ARPA
To: John McCarthy <JMC@SU-AI>
Cc: atp.schelter@UTEXAS-20.ARPA, cmp.olmstead@UTEXAS-20.ARPA
In-reply-to: Msg of 14 Apr 1985 20:58-CST from John McCarthy <JMC at SU-AI.ARPA>
There is an address at Argonne National Labs from which it
is possible, for a little more than $1000, to get what is
referred to as "DOE Macsyma". This is not just a theory.
We have got such a tape. The tape has 2 year old sources
that run on a VAX under NIL. Bill Schelter has spent
several months to get them to work on the 3600, which they
now do. He is also making the same sources run under Common
Lisp on a TI Explorer, the factory for which is in town.
It is my understanding that Bill intends to send the revised
sources back to Argonne, who will redistribute them. The
$1000 fee grants to a university a license to run the
program on any machine. If you want more information, I'm
sure Bill will be happy to provide it. If you want exact
details on what the address is, send a message to
cmp.olmstead@utexas-20, my administrative assistant.
∂14-Apr-85 2038 CL.BOYER@UTEXAS-20.ARPA [Yoni Malachi <YM@SU-AI.ARPA>: Lisp conferences proceedings ]
Received: from UTEXAS-20.ARPA by SU-AI.ARPA with TCP; 14 Apr 85 20:37:59 PST
Date: Sun 14 Apr 85 22:29:44-CST
From: Bob Boyer <CL.BOYER@UTEXAS-20.ARPA>
Subject: [Yoni Malachi <YM@SU-AI.ARPA>: Lisp conferences proceedings ]
To: JMC@SU-AI.ARPA
Looks like David Wise did a good job here:
---------------
Return-Path: <YM@SU-AI.ARPA>
Received: from SU-AI.ARPA by SU-SCORE.ARPA with TCP; Thu 11 Apr 85 12:25:44-PST
Date: 11 Apr 85 1225 PST
From: Yoni Malachi <YM@SU-AI.ARPA>
Subject: Lisp conferences proceedings
To: library@SU-SCORE.ARPA, su-bboards@SU-SCORE.ARPA,
prolog@SU-SCORE.ARPA
[from SIGACT News]
ACM SIGPLAN has republished the conference proceeding of previous Lisp
conferences.
Price
Order No. Members Others
1980 Lisp Conference (Palo Alto) 552800 $15 $21
1982 Lisp and Functional Programming (Pittsburgh) 552820 $18 $26
1984 Lisp and Functional Programming (Austin) 552840 $20 $27
Ordering address (prepaid)
ACM Order Dept.
P.O.Box 64145
Baltimore, MD 21264
-------
∂15-Apr-85 0939 berglund@Pescadero Hailperin
Received: from SU-PESCADERO.ARPA by SU-AI.ARPA with TCP; 15 Apr 85 09:39:34 PST
Date: Mon, 15 Apr 85 09:39:16 pst
From: Eric Berglund <berglund@Pescadero>
Subject: Hailperin
To: JMC@SU-AI.ARPA
What time would you like to talk to him on the 25th or 26th?
--Eric
∂15-Apr-85 1020 CLT reminder
call the person at argonne (i forget the name) about the
multiprocessing conference
also you should prompt mcc for prompt payment
∂15-Apr-85 1040 RA Hypercube meeting
The hypercube meeting is in 301.
∂15-Apr-85 1043 VAL prioritized circumscription
I have now a simpler formula for it: Circum(A;P1>P2) is equivalent to
Circum(A;P1;P2) & Circum(A;P2),
and similarly for several levels. That is, we simply circumscribe each
predicate in A varying the predicates which have lower priorities, and
take the conjunction of the results. There is no need to do the
circumscriptions sequentially. This is easier to state, to prove, and to
apply than what we discussed in the last seminar.
∂15-Apr-85 1118 berglund@Pescadero re: Hailperin
Received: from SU-PESCADERO.ARPA by SU-AI.ARPA with TCP; 15 Apr 85 11:17:47 PST
Date: Mon, 15 Apr 85 11:17:24 pst
From: Eric Berglund <berglund@Pescadero>
Subject: re: Hailperin
To: JMC@SU-AI.ARPA
I'm sorry; his plane doesn't get in 'til 1230 on the 25th. Do you have
time later that afternoon or on the 26th. To be perfectly complete, I
should tell you that he is currently scheduled to meet Terry Winograd
at 11am the 26th. Sorry about the lack of clarity.
--Eric
∂15-Apr-85 1454 RA Ross Overbeek
His office number (312) 972 2000 ext.7856. His home number (312) 369 2868.
MCS Argonne National Laboratory
Argonne, Illinois 60439
Overbeek@anl-mcs
An abstract prolog instruction set, TN 309, David Warren, Oct 1983
The Conference is on the implementation of the Warren abstract machine
and is therefore too specialized for me.
∂16-Apr-85 0800 JMC*
overbeek+squires+applications paper
∂16-Apr-85 0809 AI.WOODY@MCC.ARPA
Received: from MCC.ARPA by SU-AI.ARPA with TCP; 16 Apr 85 08:09:08 PST
Date: Tue 16 Apr 85 10:09:04-CST
From: Woody Bledsoe <AI.Woody@MCC.ARPA>
To: JMC@SU-AI.ARPA
cc: AI.Woody@MCC.ARPA, ai.barbara@MCC.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Mon 15 Apr 85 21:00:00-CST
Fine on May 16,17. We will reserve again at Brookhollow for May 15-17
unless you prefer elsewhere. (Barbara, please do). Woody
-------
∂16-Apr-85 1008 CL.BOYER@UTEXAS-20.ARPA [ATP.SCHELTER: Macsyma for the Explorer]
Received: from UTEXAS-20.ARPA by SU-AI.ARPA with TCP; 16 Apr 85 10:08:05 PST
Date: Tue, 16 Apr 1985 12:07 CST
From: CL.BOYER@UTEXAS-20.ARPA
To: jmc@su-ai
Subject: [ATP.SCHELTER: Macsyma for the Explorer]
Date: Tuesday, 16 April 1985 10:43-CST
From: Bill Schelter <ATP.SCHELTER>
To: fateman%ucbdali at UCB-VAX.ARPA
cc: cl.boyer
Re: Macsyma for the Explorer
I have just been calling it Maxima, or Doe-macsyma. I have given DOE a copy
of my changes to redistribute. It runs fine on the 3600's in release 5 or 6,
and I have done some work on an explorer, finding it around 75% of the speed
of a 3600 on say factorisation, but I still need to make some more changes for
the Explorer.
I intend to keep the files and patches on Utexas-20 (which supports
anonymous login) although of course people should have a licensce
from DOE, and even then it is unclear whether copying is really allowed.
PLot3d works. Single keystroke compiling, translating, or evaluation
of macsyma forms in the editor work well.
Is there a public list of values and results for checking the
system. There is a list on the Symbolics tape for the
vaxes, called ltest1.mac, which is fairly comprehensive.
I can't send you anything directly, but Doe will for $500. It is
then licensed for any machines at Berkeley.
Thanks for the offer of help. It would be nice to have some more
versatile plotting routines. I did one to plot curves defined
implicitly, rather than parametrically.
Bill
∂16-Apr-85 1021 VAL Circumscription Seminar
To: "@CS.DST[1,VAL]"@SU-AI.ARPA
Reminder: On April 17 Kurt Konolige will speak about the model theory of
circumscription. Time: 2pm, place: MJH301.
∂16-Apr-85 1030 CL.BOYER@UTEXAS-20.ARPA [ATP.SCHELTER: Macsyma for the Explorer]
Received: from UTEXAS-20.ARPA by SU-AI.ARPA with TCP; 16 Apr 85 10:26:57 PST
Date: Tue, 16 Apr 1985 12:26 CST
From: CL.BOYER@UTEXAS-20.ARPA
To: John McCarthy <JMC@SU-AI>
Cc: ATP.SCHELTER@UTEXAS-20
Subject: [ATP.SCHELTER: Macsyma for the Explorer]
In-reply-to: Msg of 16 Apr 1985 12:24-CST from John McCarthy <JMC at SU-AI.ARPA>
Did I not make it clear that it runs on 3600s too?
∂16-Apr-85 1648 TULEY@SU-SCORE.ARPA message
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 16 Apr 85 16:48:50 PST
Date: Tue 16 Apr 85 16:48:38-PST
From: Kimberly Tuley <TULEY@SU-SCORE.ARPA>
Subject: message
To: jmc@SU-AI.ARPA
Hello,
Phyllis Wickman, of Omega Travel Washington D.C., called about setting up
travel plans for your trip to Japan in June. She is calling through
cooperation with the Nat'l Science Foundation.
ph: 800-828-2323
Kim
-------
∂17-Apr-85 0700 JMC*
overbeek and Gary
∂17-Apr-85 1003 NILSSON@SU-SCORE.ARPA Re: SRI report request net address?
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 17 Apr 85 10:03:25 PST
Date: Wed 17 Apr 85 10:03:10-PST
From: Nils Nilsson <NILSSON@SU-SCORE.ARPA>
Subject: Re: SRI report request net address?
To: JMC@SU-AI.ARPA
cc: NILSSON@SU-SCORE.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Wed 17 Apr 85 09:16:00-PST
Try sending a request to twalker@sri-ai describing the report. After a
little dialog with (Tonita) Walker she ought to be able to locate what
you want. (Also, probably David Warren, Warren@sri-ai, still uses an
account at SRI.)
-------
∂17-Apr-85 1547 JOHN@SU-CSLI.ARPA Budget for Summer 1985
Received: from [36.9.0.46] by SU-AI.ARPA with TCP; 17 Apr 85 15:47:41 PST
Date: Wed 17 Apr 85 13:59:00-PST
From: John Perry <JOHN@SU-CSLI.ARPA>
Subject: Budget for Summer 1985
To: Barwise@SU-CSLI.ARPA, Bratman@SU-CSLI.ARPA, Bresnan@SU-CSLI.ARPA,
Etchemendy@SU-CSLI.ARPA, Kiparsky@SU-CSLI.ARPA, JMC@SU-AI.ARPA,
John@SU-CSLI.ARPA, Peters@SU-CSLI.ARPA, Sag@SU-CSLI.ARPA,
Wasow@SU-CSLI.ARPA, Winograd@SU-CSLI.ARPA, Ford@SU-CSLI.ARPA,
Poser@SU-CSLI.ARPA, SF@SU-CSLI.ARPA, Moravcsik@SU-CSLI.ARPA,
Leben%Psych@SU-CSLI.ARPA, Herb%Psych@SU-CSLI.ARPA
cc: Betsy@SU-CSLI.ARPA
We need to finalize our budget for the summer of 1985. Please do the
following if you are interested in receiving summer support:
Send Betsy:
a paragraph describing the research you will do,
the number of months of support you need from CSLI,
the other sources of summer support you have pending
or in hand,
the sources you have applied for and not received,
any other information we should have.
John
-------
∂17-Apr-85 1552 LIBRARY@SU-SCORE.ARPA Socrates
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 17 Apr 85 15:52:43 PST
Date: Wed 17 Apr 85 11:48:30-PST
From: C.S./Math Library <LIBRARY@SU-SCORE.ARPA>
Subject: Socrates
To: JMC@SU-AI.ARPA
Prof. McCarthy,
I am developing some searching techniques messages that I plan to place
in a file that everyone can use. I was thinking about making it a Help
Socrates file on Score and Sail. I think your suggestion of placing the
Green Sheet online is a great idea. I do an announcement when I get it
ready.
By the way, do you have a twin brother? I was walking on campus the other
day and strated to say hi to someone I thought was you from a distance and
realized as I got closer it wasn't you.
Harry
-------
∂17-Apr-85 1602 RA MAD
Please call John Nafeh (56) 943 1711.
∂18-Apr-85 0900 ASUBRAMANIAN@SUMEX-AIM.ARPA My real netmail address
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 18 Apr 85 09:00:15 PST
Date: Thu 18 Apr 85 09:00:16-PST
From: Ashok Subramanian <asubramanian@SUMEX-AIM.ARPA>
Subject: My real netmail address
To: jmc@SU-AI.ARPA
cc: yao@SU-SCORE.ARPA, nilsson@SU-SCORE.ARPA, papa@SU-SCORE.ARPA
Please send mail intended for me to ashok@score or ashok@sumex. Mail sent to
subramanian@sumex or subramanian@score does NOT reach me; it goes to Devika
Subramanian. I would like her to be spared the tedium of forwarding my mail to
me.
ashok
-------
∂18-Apr-85 0927 AAAI-OFFICE@SUMEX-AIM.ARPA AAAI Nominations
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 18 Apr 85 09:27:41 PST
Date: Thu 18 Apr 85 09:27:29-PST
From: AAAI <AAAI-OFFICE@SUMEX-AIM.ARPA>
Subject: AAAI Nominations
To: JMC@SU-AI.ARPA
cc: aaai-office@SUMEX-AIM.ARPA
Telephone: (415) 328-3123
Postal-Address: 445 Burgess Drive, Menlo Park, CA 94025
John,
I just thought I would inquire on how you are progressing with
the selection of the nominees for the Council. I would like
to send out the ballot by mid-May so that we can finalize the
results by Mid-July.
Cheers,
Claudia
-------
∂18-Apr-85 1045 RA David Chudnovsky
Please call David at home (212) 864 5320.
∂18-Apr-85 1150 TREITEL@SUMEX-AIM.ARPA re: Knowledge as an obstacle (from SAIL's BBOARD)
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 18 Apr 85 11:49:54 PST
Date: Thu 18 Apr 85 11:47:44-PST
From: Richard Treitel <TREITEL@SUMEX-AIM.ARPA>
Subject: re: Knowledge as an obstacle (from SAIL's BBOARD)
To: JMC@SU-AI.ARPA
cc: treitel@SUMEX-AIM.ARPA, treitel@SU-SUSHI.ARPA, su-bboards@SUMEX-AIM.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Thu 18 Apr 85 10:45:00-PST
I take this to mean that knowledge obstructs learning while bullets facilitate
it ... a Maoist, rather than Marxist, point of view, surely.
- Richard {:-)
-------
∂18-Apr-85 1401 RA leave early
It's Thursday and I am leaving early for my class. See you tomorrow.
∂18-Apr-85 1428 perlis@gymble paper
Received: from GYMBLE.ARPA by SU-AI.ARPA with TCP; 18 Apr 85 14:28:14 PST
Received: by gymble.ARPA (4.12/4.7)
id AA12570; Thu, 18 Apr 85 17:05:53 est
Date: Thu, 18 Apr 85 17:05:53 est
From: Don Perlis <perlis@gymble>
Message-Id: <8504182205.AA12570@gymble.ARPA>
To: jmc@su-ai
Subject: paper
Cc: perlis@gymble
John, I have mailed you (by USMail) a draft of a paper Jack and I
have been working on. it deals with computing circumscription in the
case of Horn data with additional protection, an intermediate step
between Reiter's result on predicate completion and Lischitz's efforts
to make circumscription more efficient as a computational tool. Any
thoughts you may have would certainly be appreciated. We plan to submit
the paper for publication in a month or so.
Note the new mailing address: perlis@gymble (yes, another Lewis Carroll
computer!) Mimsy (the usual "maryland" machine) has been ill for a week
now, and mail sent to me at maryland (or mimsy) will simply be queued
indefinitely. Tove will also do, but she is also ailing today.
Regards, Don.
∂19-Apr-85 0858 RA vacation
I would like to take a vacation from May 23 (Thurs.) to June 3rd (Mon.).
Is this ok with you?
∂19-Apr-85 0922 CLT
i think i would prefer not to have supper tonight
∂19-Apr-85 0938 overbeek@anl-mcs a brief comment
Received: from ANL-MCS.ARPA by SU-AI.ARPA with TCP; 19 Apr 85 09:37:51 PST
Return-Path: <overbeek@anl-mcs>
Received: by anl-mcs.ARPA ; Fri, 19 Apr 85 11:36:17 cst
Date: Fri, 19 Apr 85 11:36:17 cst
From: overbeek@anl-mcs (Overbeek)
Message-Id: <8504191736.AA19751@anl-mcs.ARPA>
To: jmc@su-ai.ARPA
Subject: a brief comment
I sent off copies of a number of research reports on our
early work on the HEP. Most of the examples in our C tutorial
are either very trivial or numeric. However, they do illustrate
exactly how we think the portable task dispatching mechanism should
be implemented. We have used these techniques to implement
a portable version of the Warren abstract machine for use on
multiprocessors. We plan on having OR-parallelism operable this
month, so we will have concrete results soon.
I agree that globally-shared memory will be highly-desirable
for most symbolic processing. The programmer will pay a substantial
penalty for even "clusters that are loosely-coupled", where the processes
in a cluster share a common memory.
I disagree with your comments on the HEP. Although I have reservations
about the HEP, I believe that the distinction between program and
data memory need not seriously impair the implementation of a LISP
compiler. I realize that I speak from relative ignorance here, but let
me explain my outlook. First, I believe that a portable implementation
can be based on the strategy of intrerpreting code for an abstract
machine. Our experience in Prolog implementation leads us to
believe that you can get within a factor of 2 of compilation
into native code using this approach. On the other hand, if you
feel that compilation to native code is critical, it would be
fairly straightforward to hide the distinction of memory types.
For example, it would be a minor matter to implement routines of
the form "claim a block of program memory" and "move a block of data
from data memory to a designated location in program memory". With
these (and a few routines to hide this operation from the main
body of code in the compiler), one need hardly be aware of the
distinction in memory types (and I believe that there are sound
reasons for making such a distinction in the case of the HEP).
The Sequent is certainly an adequate machine for exploring
parallelism, and I do not mean to advocate the HEP. However,
I believe that the major objection revolves around cost. The
actual machine does offer a convenient environment to explore
parallelism, and we are moving a fairly substantial effort
onto it with minimal grief.
If we can be of any assistance, please feel free to call or to
have Gabriel call.
∂19-Apr-85 1020 RA Will Kessler
Following Martin Lipset suggestion, Will Kessler (a student) would like to
meet with you. Would you like to set an appointment for him, or would you
like him to just drop by. He'll call me back. His tel: 325 6370.
∂19-Apr-85 1027 VAL
Any news about the availability of funds for me?
∂19-Apr-85 1037 avg@diablo re: No More Joe Bob!!
Received: from SU-AIMVAX.ARPA by SU-AI.ARPA with TCP; 19 Apr 85 10:36:48 PST
Date: Fri, 19 Apr 85 10:37:22 pst
From: Allen VanGelder <avg@diablo>
Subject: re: No More Joe Bob!!
To: JMC@Sail, su-bboards@diablo
JMC and some others have made some comments about people who think
jokes about one group are OK and another taboo. One obvious
objective criterion that is being ignored is this:
Do the people in the group you are making jokes about belong to that
group by CHOICE? If they do not (women, blacks, handicapped, e.g.),
then I think the concensus of sensitive people is that derogatory jokes
about them are in bad taste. If they do (politicians, lawyers, football
players, computer scientists, etc.), then such jokes are a form of
criticism and complaint, which most people think is permissible.
If you think criticism of Republican presidents is objectionable, then
you probably think jokes about them also are.
Now an interesting question is what type of group are homosexuals,
voluntary or involuntary? I'd say it's some of both, so jokes about
them are in QUESTIONABLE taste. If the joke ridicules some aspect of
their behavior that is clearly voluntary, I would not say that it is
ipso facto in bad taste.
Along the same lines, a joke about the way feminists behave is
not in bad taste, but jokes about the looks are.
∂19-Apr-85 1214 RA Re: vacation
[Reply to message recvd: 19 Apr 85 11:14-PST]
I'll be back June 4th.
∂19-Apr-85 1214 RA lunch
I am going out for lunch; be back in about an hour.
∂19-Apr-85 1251 CLT
did you inquire of Nils as to the best way to extract
a copy or two of the warren abstract machine paper from sri??
∂19-Apr-85 1410 VAL
It's "Computing Circumscription" in Proc. IJCAI-85.
∂19-Apr-85 1528 BSCOTT@SU-SCORE.ARPA ARPA Contracts (McCarthy; ARPA Umbrella
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 19 Apr 85 15:28:08 PST
Date: Fri 19 Apr 85 15:27:53-PST
From: Betty Scott <BSCOTT@SU-SCORE.ARPA>
Subject: ARPA Contracts (McCarthy; ARPA Umbrella
To: JMC@SU-AI.ARPA, TOB@SU-AI.ARPA, ZM@SU-AI.ARPA, DCL@SU-AI.ARPA,
Wiederhold@SUMEX-AIM.ARPA
cc: LES@SU-AI.ARPA, Hassler@SU-SCORE.ARPA, BScott@SU-SCORE.ARPA
Ron Ohlander was here this week, and I met with him and Nils Nilsson to
come to a final agreement as to how to deal with the Binford, Luckham,
Manna and Wiederhold overexpenditures against John McCarthy's contract.
With Binford and Luckham receiving credit for their loans to McCarthy
and Wiederhold, McCarthy is owed the following amounts:
From: Binford 4l,230
Luckham 167,783
Manna 10,041
Wiederhold 172,786
-------
Total 391,840
McCarthy will recover these funds by direct charge of his own expenditures
to the Binford, Luckham, Manna and Wiederhold allocations of the ARPA
umbrella contract. A very precise accounting will be kept of the charges
and everyone will be notified of charges being made. No McCarthy travel
or equipment charges will be made against any of the accounts.
David Luckham's account is administered by SEL, and any charges generated
against his funds will be routed through Jack LaBrie in SEL for signature.
An exception to this is computer usage charges which are made by expense
allocation; SEL signature is not required, but Jack LaBrie will receive
a copy of the expense allocation sheets. Since Jack does not read or have
access to electronic mail, I am sending him a hard copy of this message.
If any of you have questions, please let me know.
Apologies for taking so very long to get this all settled. Ron Ohlander's
visit and counsel this week was extremely helpful in working everything out.
Betty
-------
∂19-Apr-85 1547 VAL Circumscription seminar
To: "@CS.DST[1,VAL]"@SU-AI.ARPA
On April 24 I will speak about the satisfiability of circumscription: the
Etherington - Mercer - Reiter theorem, its generalizations that Kurt mentioned
last time, and a further generalization to prioritized circumscription. As
usual, we meet in MJH301 at 2pm.
--Vladimir Lifschitz
∂19-Apr-85 1620 fateman%ucbdali@Berkeley Qlisp
Received: from UCB-VAX.ARPA by SU-AI.ARPA with TCP; 19 Apr 85 16:20:01 PST
Received: from ucbdali.ARPA by UCB-VAX.ARPA (4.24/4.45)
id AA28076; Fri, 19 Apr 85 16:01:15 pst
Received: by ucbdali.ARPA (4.24/4.45)
id AA01600; Fri, 19 Apr 85 16:02:01 pst
Date: Fri, 19 Apr 85 16:02:01 pst
From: fateman%ucbdali@Berkeley (Richard Fateman)
Message-Id: <8504200002.AA01600@ucbdali.ARPA>
To: JMC@SU-AI.ARPA
Subject: Qlisp
A Sequent processor has been installed at Berkeley, and is probably
accessible via the arpa net. (it is on an internal ethernet).
∂20-Apr-85 1000 JMC*
charge slips to bookstore
∂21-Apr-85 1251 BAMPI@SU-SIERRA.ARPA JMC reads Ortega
Received: from SU-SIERRA.ARPA by SU-AI.ARPA with TCP; 21 Apr 85 12:51:13 PST
Date: Sun 21 Apr 85 12:51:28-PST
From: Sergio Bampi <BAMPI@SU-SIERRA.ARPA>
Subject: JMC reads Ortega
To: su-bboards@SU-SIERRA.ARPA, jmc@SU-AI.ARPA
"...Ortega said he is was a Marxist-Leninist. In the political language of
today, that means a supporter and user of the political methods of the
Soviet Union." (jmc)
Let me point that in the political language of today, that is the reading
of the word "Marxism-Leninism" clearly accepted and sponsored by the RIGHT.
Nobody would expect the Right to follow the evolution of left thought...
How does the multi-party system of Nicaragua fits into Lenin's "The Question
of the Party"? Is Nicaragua's mixed (private & state-owned) economy compatible
with Marxism-Leninism?
It would be fair to say that Ortega is less worried about being a
marxist-leninist than about making a popular revolution to work for the
majority in a day-by-day praxis.
Philosophically, it is easy to understand all of the above: Simply the RIGHT
masters IDEOLOGY, i.e. THEORY unaccompanied by PRAXIS, while the LEFT works
to transform material conditions which engender IDEOLOGY.
Nuff said, over and off.
Sergio
-------
∂21-Apr-85 1408 RPG Program versus data memory
To: overbeek@ANL-MCS.ARPA
CC: JMC@SU-AI.ARPA, LES@SU-AI.ARPA, CLT@SU-AI.ARPA
With Lisp I doubt that one could get within a factor of 2 between
a byte-code interpreter and a native code compiler. The reason is that
Lisp operations often correspond to single instructions in native
code, and frequently they correspond to addressing operations. With
a byte code intepreter one might find a factor of 3 up to 10
for these operations.
Next, Lisp code is very function-call heavy. As I recall, every 50
bytes in the instruction stream is a function call on a 68000
implementation of Lisp. If one adds code at the function-call and
function-return ends of a function, where functions tend to be only
a few hundred bytes long, one might be doubling or tripling the
function call time for Lisp. The average Lisp function calls 4.5 others.
In terms of performance, an interpreter could be 5 times slower, and
a function pager perhaps 3 times slower, given the additional
instructions at both ends of short functions. With these sorts of
expectations, any experiment that tried to answer the question,
how much faster is a parallel machine on this problem than a
well-tuned uniprocessor?, would possibly wind up with the wrong
answer by a wide margin. Also, one would expect that the memory
traffic profile would be quite different from a `real' Lisp
implementation on a more desirable architecture.
-rpg-
∂22-Apr-85 0927 SQUIRES@USC-ISI.ARPA Re: uniform access to memory
Received: from USC-ISI.ARPA by SU-AI.ARPA with TCP; 22 Apr 85 09:26:50 PST
Date: 22 Apr 1985 12:26-EST
Sender: SQUIRES@USC-ISI.ARPA
Subject: Re: uniform access to memory
From: Stephen L. Squires <SQUIRES@USC-ISI.ARPA>
To: JMC@SU-AI.ARPA
Cc: squires@USC-ISI.ARPA, overbeek@ANL-MCS.ARPA
Cc: RPG@SU-AI.ARPA, LES@SU-AI.ARPA, CLT@SU-AI.ARPA
Cc: fateman@UCB-VAX.ARPA
Message-ID: <[USC-ISI.ARPA]22-Apr-85 12:26:36.SQUIRES>
In-Reply-To: The message of 17 Apr 85 1823 PST from John McCarthy <JMC@SU-AI.ARPA>
This is the same conclusion that we came to over a year ago.
It turns out the prototype systems that we have decided to pursue
over the next few years will provide uniform access to memory.
These projects will produce a "medium" scale verions in 2 years,
a "large" scale a year later, and be in a position to produce copies
at different scales for use within the research community and selected
other appliations. I expect that you will find these to be sufficiently
ambitious in terms of uniformity, memory size, number of processors,
and I/O bandwidth.
I will be glad to discuss some of these further and will be open
to your advise to make sure that these will meet your expectations!
∂22-Apr-85 0954 HEDGES@SU-SCORE.ARPA Robotics Search Meeting with Zucker
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 22 Apr 85 09:54:40 PST
Date: Mon 22 Apr 85 09:53:10-PST
From: Karen Hedges <HEDGES@SU-SCORE.ARPA>
Subject: Robotics Search Meeting with Zucker
To: Cannon@SU-SIERRA.ARPA, TOB@SU-AI.ARPA, JMC@SU-AI.ARPA,
Reynolds@SU-SCORE.ARPA, BScott@SU-SCORE.ARPA
cc: Nilsson@SU-SCORE.ARPA
REMINDER: The Robotics Search Committee is scheduled to meet with Steven
Zucker @ 2:30 pm in the Chairman's Conference Room (MJH) tomorrow
April 23.
-------
∂22-Apr-85 1153 RA Your daughter Suzan
Please call your daughter Suzan.
∂22-Apr-85 1249 MOGUL@SU-SCORE.ARPA Who is lying about Nicaragua?
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 22 Apr 85 12:49:02 PST
Date: Mon 22 Apr 85 12:17:00-PST
From: Jeffrey Mogul <MOGUL@SU-SCORE.ARPA>
Subject: Who is lying about Nicaragua?
To: JMC@SU-AI.ARPA, OTHER-SU-BBOARDS@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Fri 19 Apr 85 23:23:00-PST
I should like to point out to JMC that my message did not list
Ortega's Marxism as one of the Reagan administration's lies.
I said that (quoting myself from memory) to accuse the Sandinistas
of being totalitarian, unusually repressive, or of having rigged
the elections, is lying. I stand by this.
Others have already pointed out the inaccuracy of equating Marxism
with totalitarianism, anti-democratism, or the Stalinism that
JMC justifiably condemns.
The Sandinistas may not be such nice people. They certainly have
done things worthy of condemnation. They may even wish to
construct a totalitarian state. Unless they do so, there is
no justification for financing terrorists (calling them freedom
fighters is like calling the SS victims of Nazism). We make a
point of refusing to negotiate with terrorists; why shouldn't
the Nicarguans?
I have a counter-proposal to JMC's: the Sandinistas would like
US aid. How about if we offered them, say, 1/10th of 1% of our
defense budget (for non-military aid) if they offer amnesty to
the contras who lay down their arms, stop censoring La Prensa,
sign the Contadora accords, and continue to hold un-rigged
elections? Let's try to buy some friendly commies, instead of
forcing them into the arms of the Soviets.
-------
∂22-Apr-85 1450 BAMPI@SU-SIERRA.ARPA re: Who is lying about Nicaragua?
Received: from SU-SIERRA.ARPA by SU-AI.ARPA with TCP; 22 Apr 85 14:50:48 PST
Date: Mon 22 Apr 85 14:50:50-PST
From: Sergio Bampi <BAMPI@SU-SIERRA.ARPA>
Subject: re: Who is lying about Nicaragua?
To: JMC@SU-AI.ARPA
cc: MOGUL@SU-SCORE.ARPA, su-bboards@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Mon 22 Apr 85 13:29:00-PST
As to the $75 m the Carter Admin. "gave" Nicaragua,
let's get some facts straight:
- No Administration GIVES money to the 3rd world. What is listed as military
aid is actually american-made military equipment, and what is listed
as economic aid varies from subsidized interest rates to surplus food
-- involving "goods" of american banks & american farmers.
- The Carter Admin. appropriated aid funds for Nicaragua after the July '79
victory. As soon as the liberal bourgois elements of the Junta -- like
La Prensa's owner (Chamorro's widow) -- started to defect the Junta,
and at same time the Salvadoran left stepped up the fight against the
Salvadoran Junta, the Carter Adm. withdrew support for the Sandinistas
- which were the armed branch of the opposition to Somoza's regime.
- Whatever "aid" Carter actually transferred to Nicaragua -- then completely
drained by the well-off who fled before victory -- that is peanuts
compared to the assets which the same well-off (now supporting the
"contras") transferred to Miami.
- By mid-1980, the Carter Adm. had already turned its back on the Sandinistas.
European social-democrats did not, of course -- they are not as much
paranoid about socialism.....
Moral of the history: " Getting the pertinent facts straight is already
difficult -- let alone their interpretation. "
Sergio
-------
∂22-Apr-85 1507 MOGUL@SU-SCORE.ARPA re: Who is lying about Nicaragua?
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 22 Apr 85 15:07:03 PST
Date: Mon 22 Apr 85 15:06:52-PST
From: Jeffrey Mogul <MOGUL@SU-SCORE.ARPA>
Subject: re: Who is lying about Nicaragua?
To: JMC@SU-AI.ARPA, su-bboards@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Mon 22 Apr 85 13:29:00-PST
JMC asks a few questions:
The Carter Administration gave the Sandinistas $75 million which is a
third of what you advocate. It didn't make them democrats or keep them
out of the arms of the Soviets and Cubans.
I doubt Carter gave the aid as a quid pro quo. However, the charge
that they are not democrats is contrary to substantial evidence.
One suspects that the only way they could have gotten Reagan to
concede the validity of the 1984 election would be to have arranged
to lose it. Sometimes people vote for marxists; that's the risk
you take with democracy.
As to "keeping them out of the arms of the Soviets and Cubans":
any sovereign nation has the right to recognize and take assistance
from any other country. Perhaps you don't believe that a small
country can be friendly with both the US and the USSR; I trust
you would rather not have this be a self-fulfilling prophecy?
Why do you call the contras, who include original Sandanista supporters,
terrorists? Do you call all anti-Government rebels terrorists, whatever
the government - e.g. El Salvador and Afghanistan?
"Terrorist" is a word much worsened for its use to describe anybody
who employs violence to an end one doesn't agree with. I should probably
not have used it, but I believe I did use it consistent with the
dictionary definition (from my desk dictionary):
"Terrorism: the use of force or threats to intimidate, etc.,
esp. as a political policy."
Now, this immediately includes Reagan's stated goal not to overthrow
the Nicaraguan government, but to "pressure" them and "make them
say `uncle'."
Of course not all anti-government rebels are terrorists;
the resistance against the Nazis, the quixotic resistance in Afghanistan,
etc. are not usually thought of a terrorists.
So, what distinguishes a terrorist from a rebel? Well, a rebel
usually has the decency to shoot at soldiers but not at women,
children, doctors, etc. A rebel, one hopes, has the support
of the native population (as Pol Pot's forces do not.)
It is also important to realize that the distinction is not
always clear; terrorists can have popular support, rebels
can commit acts of terror, and should be condemned for it.
The Sandinistas of the late 1970s fit my definition of rebels.
The contras of 1985 do not.
By the way, if it is so important to you that the contras include
former members of the anti-Somoza forces, then please write
your government and ask them to fund Eden Pastora instead of
the current goons. For some reason, the CIA prefers to deal
with former members of the National Guard; perhaps it's because
they take orders better.
Should the El Salvador government negotiate with its rebels?
Yes. Of course, the FMLN isn't free of terrorist tendencies,
but then neither is the Salvadoran government. The Salvadorans
have a history of rigging elections and murdering opposition
candidates, whereas the Sandinistas don't, so I have somewhat
more sympathy for the rebels in El Salvador.
But all this talk about rebels and terrorists is missing the
point: we rightly condemn the Soviets for interfering in the
affairs of their neighbors, so we should practice what we
preach. The argument that "they do it, so we must" is an
immoral one.
-------
∂22-Apr-85 2147 JOCK@SU-SCORE.ARPA LABREA
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 22 Apr 85 21:47:11 PST
Date: Mon 22 Apr 85 21:47:14-PST
From: Jock Mackinlay <JOCK@SU-SCORE.ARPA>
Subject: LABREA
To: jmc@SU-AI.ARPA
John, How do I get an account on LABREA?
Jock
-------
∂22-Apr-85 2226 GROSOF@SU-SCORE.ARPA notes on your draft
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 22 Apr 85 22:26:13 PST
Date: Mon 22 Apr 85 22:26:00-PST
From: Benjamin N. Grosof <GROSOF@SU-SCORE.ARPA>
Subject: notes on your draft
To: jmc@SU-AI.ARPA
cc: grosof@SU-SCORE.ARPA
Hi John,
(1) The reference on my workshop paper, pertaining to section 13,
point 3, on page 21, of your draft is:
Grosof, Benjamin (1984): "Default Reasoning As Circumscription", AAAI
Workshop on Non-Monotonic Reasoning, held in Mohonk, NY, October 17-19.
(There exists a revised version. I plan to get the revised version published
at some indefinite future date.)
(2) Pertaining to section 1, last sentence, page 2, of your draft:
We can accomplish the desired effect of examples 1 and 2 in your 1980 paper
which deal with minimizing the members of a set, via circumscribing
abnormality. We just add the axiom:
(All x). block x => ab aspect4 x
In general, to minimize the set characterized as { x | E(P,x) }
(where E is an expression and P is a tuple of predicate (or other) variables/
symbols, as in section 2 of your draft):
just add the axiom:
(All x). E(P,x) => ab aspect17 x
Informal proof:
Reformulate the axioms so as to replace {lambda x. ab aspectN x} by
{lambda x. abN x} for each N. Then apply Proposition 7 from
Vladimir's Workshop paper.
Benjamin
-------
∂23-Apr-85 0900 JMC*
Claudia
∂23-Apr-85 0934 HANRAHAN@SU-SCORE.ARPA
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 23 Apr 85 09:34:00 PST
Date: Tue 23 Apr 85 09:26:35-PST
From: Katherine Hanrahan <HANRAHAN@SU-SCORE.ARPA>
To: mccarthy@SU-SCORE.ARPA
Stanford-Phone: (415) 497-2273
David 212 864-5320 (said you would know who it was) Katie
-------
∂23-Apr-85 1014 CLT
tonight -- no supper
∂23-Apr-85 1208 RA lunch
I am going out for lunch; will be back in about an hour.
∂23-Apr-85 1302 LES Blasgen contact
I finally reached Mike Blasgen and asked if he had had a chance to review
the message from you a couple of weeks ago. He said that it was under active
review -- in fact he was discussing it at that moment with John Cock.
He said he was clanking the IBM bureaucracy (which he asserted is even worse
than ours) and expects to be able to tell us something within a week.
∂23-Apr-85 1315 JJW SAIL disk usage
To: ME@SU-AI.ARPA, JMC@SU-AI.ARPA, Bosack@SU-SCORE.ARPA
I've plotted the amount of free disk space on SAIL since we got the new
disks. The graph below shows the number of free blocks, including "lost"
blocks that would be recovered by a disk audit, on the 8th and 23rd of
each month. At this rate we'll have to do something in a few months.
**
100 *
*
90 *
***
80 ****
*
70 ***
* *
60 ** **
* **
50 *** *
***
40 **
*
30 ***
*
20
10
S O N D J F M A M J J A S O N D J F M A
83 | 84 | 85
∂23-Apr-85 1456 JOCK@SU-SCORE.ARPA re: LABREA
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 23 Apr 85 14:56:41 PST
Date: Tue 23 Apr 85 14:40:40-PST
From: Jock Mackinlay <JOCK@SU-SCORE.ARPA>
Subject: re: LABREA
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Mon 22 Apr 85 23:04:00-PST
Thanks
Jock
-------
∂23-Apr-85 1709 JJW Re: SAIL disk usage
To: JMC@SU-AI.ARPA, ME@SU-AI.ARPA, Bosack@SU-SCORE.ARPA
∂23-Apr-85 1406 JMC re: SAIL disk usage
To: JJW@SU-AI.ARPA, ME@SU-AI.ARPA, Bosack@SU-SCORE.ARPA
[In reply to message from JJW rcvd 23-Apr-85 13:15-PT.]
Clearly what needs to be done is to be able to use LaBrea's 4 gigabytes.
What's the plan.
JJW - As far as I know there is no concrete plan on how to use LaBrea.
Right now it could be used to store and retrieve files with FTP, but
this is somewhat cumbersome. A more transparent archiving system would
be nice to have.
∂23-Apr-85 2205 GARDNER@SUMEX-AIM.ARPA Your presidential address in Austin
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 23 Apr 85 22:05:13 PST
Date: Tue 23 Apr 85 22:05:29-PST
From: Anne Gardner <GARDNER@SUMEX-AIM.ARPA>
Subject: Your presidential address in Austin
To: jmc@SU-AI.ARPA
cc: gardner@SUMEX-AIM.ARPA
Is a copy of your Austin talk available, even in rough draft?
If I remember correctly, you had a list of important unsolved problems
in AI. It seemed to me at the time that almost all of them come up, in a
realistic context, in law. I'd like to be able to refer to that list in
a paper that I'm writing. I understand that the talk will eventually
come out in AI Magazine, but unfortunately my paper is already overdue.
(It's an article on "law applications" for the Encyclopedia of AI.)
--Anne
-------
∂24-Apr-85 0848 ASHOK@SU-SUSHI.ARPA Re: Uday Reddy
Received: from SU-SUSHI.ARPA by SU-AI.ARPA with TCP; 24 Apr 85 08:47:43 PST
Date: Wed 24 Apr 85 08:48:00-PST
From: Ashok Subramanian <ashok@SU-SUSHI.ARPA>
Subject: Re: Uday Reddy
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Wed 17 Apr 85 13:36:06-PST
Would it be possible for Uday to set aside at least an hour on Monday,
so that students can get a chance to talk with him ? If we can decide
upon a time, I could reserve a room, and send a message to the csd
mailing list.
ashok
-------
∂24-Apr-85 0958 berglund@Pescadero Max Hailperin
Received: from SU-PESCADERO.ARPA by SU-AI.ARPA with TCP; 24 Apr 85 09:58:04 PST
Date: Wed, 24 Apr 85 09:58:31 pst
From: Eric Berglund <berglund@Pescadero>
Subject: Max Hailperin
To: jmc@sail
Just a reminder that I'll be bringing him by tomorrow at 3:00.
--Eric
∂24-Apr-85 1121 SJG circumscription article
Dear John:
I've read through the circumscription paper, and have a variety of comments.
The first few are comments I would make as a reviewer if you hadn't
written the paper (and might make anyway, but that's only a demonstration
of my lack of respect for authority):
The paper reads choppily. Section 4 seems unifinished (only because it's so
short), and section 6 (unique names) is especially bad. I am aware that
this latter is at least in part due to the inelegance of what you're trying
to present, but hope that it could be made easier to follow nevertheless.
Something that I would have liked to see is more about the statement on
pages 8-9: " ... this doesn't work, and nothing similar works." A proof
that circumscribing equality doesn't work would have been nice (surely
you can repeat Reiter and Etherington's example, especially as it's not yet
published and you don't seem to have a reference to it). What does "nothing
similar" mean? Could you have given some examples and shown why they
don't work? It would have served as valuable motivation for what is
surely an ugly and unintuitive construction (the one you do present).
Section 3 (the typology) is interesting, but seems to belong in another
paper. (Perhaps the paper saying what's wrong with probabilities.) The claim
about auto-epistemic reasoning, "perhaps it can be handled by circumscription,"
is completely unjustified. Why should I believe it?
Some less general comments:
The idea on page twelve about making both aspects the same is an interesting
one, but it REALLY runs counter to my intuition. I would expect to have
separated x ⊃ ab aspect1 x
for example, but would still expect x to live where he works (especially
now). So I don't think I believe this as a way out.
*On page 17, "systems" in #3 should be "system". And in #4 you seem to
have left out a word or two.
*On page 18, just above section 12, "there" should be "these".
I still found the EKL proofs confusing. Oh, well.
I hope these comments help. On a completely unrelated note, I'll be
visiting MIT in a couple of weeks. Should I try and spend some time
talking to Minsky?
See you soon --
Matt
∂24-Apr-85 1203 CLT
∂24-Apr-85 1202 RWW
∂24-Apr-85 1148 CLT
what is the name of the indian restuarant in sf (opera plaza)?
KUNDAN
∂24-Apr-85 1230 RA David Chudnovsky
David is in SF. His number (55) 589 7200 ext. 110. Please call him.
∂24-Apr-85 1419 @MIT-MC:MINSKY@MIT-OZ
Received: from MIT-MC.ARPA by SU-AI.ARPA with TCP; 24 Apr 85 14:19:11 PST
Received: from MIT-OZ by MIT-MC via Chaosnet; 24 APR 85 17:17:55 EST
Date: Wed, 24 Apr 1985 17:17 EST
Message-ID: <MINSKY.12105791316.BABYL@MIT-OZ>
From: MINSKY%MIT-OZ@MIT-MC.ARPA
To: jmc@SU-AI.ARPA, minsky%MIT-OZ@MIT-MC.ARPA
Hi, John.
In a couple of weeks will appear a character named Eric Drexler
who invents light-sails, micro-micro-computation elements and
other kinds of things that you and I and Morevic and Lowell
Wood type people like. He also has ideas about future societies, etc.
Well worth meeting him. He might be a good person to be some kind
of affiliate of your laboratory, because he is good at giving students
better ambitions.
∂24-Apr-85 1516 @STONY-BROOK.SCRC.Symbolics.COM:rwg@RUSSIAN.SPA.Symbolics.COM melzak
Received: from SCRC-STONY-BROOK.ARPA by SU-AI.ARPA with TCP; 24 Apr 85 15:16:30 PST
Received: from RUSSIAN.SPA.Symbolics.COM by STONY-BROOK.SCRC.Symbolics.COM via CHAOS with CHAOS-MAIL id 223346; Wed 24-Apr-85 18:16:07-EST
Received: from SPA-EUROPA by SPA-RUSSIAN via CHAOS with CHAOS-MAIL id 114693; Wed 24-Apr-85 15:15:40-PST
Date: Wed, 24 Apr 85 15:12 PST
From: Bill Gosper <rwg@RUSSIAN.SPA.Symbolics.COM>
Subject: melzak
To: jmc@SU-AI.ARPA
Message-ID: <850424151200.1.RWG@SPA-EUROPA.SPA.Symbolics.COM>
is out of print. but, last week at least, there was a $25 used copy at
chim(a)era, in v. good condition.
∂24-Apr-85 1528 ASHOK@SU-SUSHI.ARPA [John McCarthy <JMC@SU-AI.ARPA>: re: Uday Reddy ]
Received: from SU-SUSHI.ARPA by SU-AI.ARPA with TCP; 24 Apr 85 15:28:05 PST
Date: Wed 24 Apr 85 15:28:22-PST
From: Ashok Subramanian <ashok@SU-SUSHI.ARPA>
Subject: [John McCarthy <JMC@SU-AI.ARPA>: re: Uday Reddy ]
To: yao@SU-SCORE.ARPA, nilsson@SU-SCORE.ARPA
cc: jmc@SU-AI.ARPA, ashok@SU-SUSHI.ARPA
In response to:
----------------------------------------------------------------
Date: 24 Apr 85 1014 PST
From: John McCarthy <JMC@SU-AI.ARPA>
Subject: re: Uday Reddy
To: ashok@SU-SUSHI.ARPA
Please call Reddy and arrange his visit including a talk on Monday.
Try to make sure Andy and Nils can make it. Except for the possible
jury duty I can make it at any time on Monday.
Uday Reddy, REDDY@utah-20, 801 581-8378
--------------------------------------------------------------------------
I'd like to know what your current schedules are like, so that I can ensure
that all of you can make the talk. I believe we are looking at a talk with
enough people to fill MJ 252, or 301, but not something of the scale of a
colloquium. Please correct me if I am way off the mark.
My proposal is to schedule an hour for the talk plus discussion, with
about an hour afterward for students to just walk in and talk to him.
I would also like to know what departmental resources I can use to
make long-distance calls. I believe that the general procedure is to
use certain long-distance codes, but I do not know the details.
I would also like to enquire just how confidential the details of this
call (and of others I may need to place in the future) need to be. If
you feel that these matters are best kept out of the open until they
need to surface, then it is perhaps best that I do not make them from my
office. Is there an alternative place I could use for the purpose?
Is there anything else I should be worrying about?
ashok
-------
∂24-Apr-85 1654 AAAI-OFFICE@SUMEX-AIM.ARPA Nominations
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 24 Apr 85 16:54:27 PST
Date: Wed 24 Apr 85 16:54:37-PST
From: AAAI <AAAI-OFFICE@SUMEX-AIM.ARPA>
Subject: Nominations
To: JMC@SU-AI.ARPA
cc: aaai-office@SUMEX-AIM.ARPA
Telephone: (415) 328-3123
Postal-Address: 445 Burgess Drive, Menlo Park, CA 94025
I just checked the database and discovered that Brown, Pereira,
and Robinson are NOT members. I think we should still ask
them to be on the council only if they become a member.
Claudia
-------
∂25-Apr-85 0900 JMC*
Companion to Concrete Math. Lytton and Kipling
∂25-Apr-85 0917 HEDGES@SU-SCORE.ARPA CS224 Artificial Intelligence Seminar
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 25 Apr 85 09:12:16 PST
Date: Thu 25 Apr 85 09:02:17-PST
From: Karen Hedges <HEDGES@SU-SCORE.ARPA>
Subject: CS224 Artificial Intelligence Seminar
To: JMC@SU-AI.ARPA
Dr. McCarthy:
This is just to remind you about that presentation you are making entitled
"Commonsense Knowledge and Reasoning in Logic" for the CS224 AI Seminar on
Thursday, May 2, in Skilling Auditorium from 11:00 - 12:15.
Please let me know if you will need any audio-visual equipment so I can let
the TV people know.
Thank you.
Karen
-------
∂25-Apr-85 0954 BARWISE@SU-CSLI.ARPA Fulbright Scholar Program
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 25 Apr 85 09:53:38 PST
Date: Thu 25 Apr 85 09:48:40-PST
From: Jon Barwise <BARWISE@SU-CSLI.ARPA>
Subject: Fulbright Scholar Program
To: Researchers@SU-CSLI.ARPA
I received a copy of the Fulbright Research and Lecturer Awards book
that tells what is available for next year. I will leave it with
Ingrid for you to borrow if you are interested. I also got one set of
application blanks. Don't take that unless you really plan to apply.
-------
∂25-Apr-85 1004 @SU-CSLI.ARPA:CLT@SU-AI.ARPA Seminar in Logic and Foundations of Mathematics
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 25 Apr 85 10:02:34 PST
Received: from SU-AI.ARPA by SU-CSLI.ARPA with TCP; Thu 25 Apr 85 09:58:59-PST
Date: 25 Apr 85 0946 PST
From: Carolyn Talcott <CLT@SU-AI.ARPA>
Subject: Seminar in Logic and Foundations of Mathematics
To: "@DIS.DIS[1,CLT]"@SU-AI.ARPA
Speaker: Prof. Itala d'Ottaviano, Univ. of Campinas, Brazil,
visiting Stanford and UC Berkeley
Title: Extension model theorems, definability and quantifier-
elimination for some many-valued theories.
Time: Tuesday, April 30, 4:15-5:30 P.M.
Place: Room 381-T, Math. Dept., Bldg. 380, Stanford
S. Feferman
∂25-Apr-85 1046 ASHOK@SU-SUSHI.ARPA Re: Uday Reddy
Received: from SU-SUSHI.ARPA by SU-AI.ARPA with TCP; 25 Apr 85 10:42:45 PST
Date: Thu 25 Apr 85 10:43:11-PST
From: Ashok Subramanian <ashok@SU-SUSHI.ARPA>
Subject: Re: Uday Reddy
To: JMC@SU-AI.ARPA
cc: ashok@SU-SUSHI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Wed 17 Apr 85 13:36:06-PST
Re:
" It is customary, however, not to identify speakers as job seekers in
bulletin board announcements."
I need to be able to get CSD students to show up and meet faculty
candidates, so that I can get feedback from them. I was planning to
mail a message identifying Uday Reddy as a candidate to the csd
mailing list, but not to bboard.
Is this OK ? If not, how do you propose I can get csd students to show up for
his talk, or just to meet him ?
ashok
-------
∂25-Apr-85 1046 ASHOK@SU-SUSHI.ARPA Faculty candidate
Received: from SU-SUSHI.ARPA by SU-AI.ARPA with TCP; 25 Apr 85 10:46:15 PST
Date: Thu 25 Apr 85 10:46:40-PST
From: Ashok Subramanian <ashok@SU-SUSHI.ARPA>
Subject: Faculty candidate
To: jmc@SU-AI.ARPA, nilsson@SU-SCORE.ARPA, papa@SU-SCORE.ARPA, yao@SU-SCORE.ARPA
cc: ashok@SU-SUSHI.ARPA
Uday Reddy is tentatively scheduled to give a talk on Monday the 29th, at
2 pm in MJ 252. Abstract will follow.
ashok
-------
∂25-Apr-85 1141 VAL re: Applications of circumscription paper
[In reply to message rcvd 19-Apr-85 15:47-PT.]
I have a few remarks about the paper. Let's talk when you have a minute.
∂25-Apr-85 1156 kessler%utah-orion@utah-cs Cray PSL and Bignums
Received: from UTAH-CS.ARPA by SU-AI.ARPA with TCP; 25 Apr 85 11:56:27 PST
Received: from utah-orion.ARPA by utah-cs.ARPA (4.42/4.40.2)
id AA24310; Thu, 25 Apr 85 12:56:42 MST
Received: by utah-orion.ARPA (4.42/4.40.2)
id AA23427; Thu, 25 Apr 85 12:56:38 MST
Date: Thu, 25 Apr 85 12:56:38 MST
From: kessler%utah-orion@utah-cs (Robert Kessler)
Message-Id: <8504251956.AA23427@utah-orion.ARPA>
To: JMC@su-ai.arpa
Subject: Cray PSL and Bignums
Yes it does (as of about a month ago). The livermore Cray just got
a copy this week (if that is which machine you are planning on using).
Bob.
∂25-Apr-85 1200 AAAI-OFFICE@SUMEX-AIM.ARPA Conference Proposals
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 25 Apr 85 12:00:17 PST
Date: Thu 25 Apr 85 11:50:54-PST
From: AAAI <AAAI-OFFICE@SUMEX-AIM.ARPA>
Subject: Conference Proposals
To: Amarel@RUTGERS.ARPA, ai.woody@MCC.ARPA, Fikes@USC-ECL.ARPA,
Brachman@SRI-KL.ARPA, Buchanan@SUMEX-AIM.ARPA, Charniak@YALE.ARPA,
KRD@MIT-MC.ARPA, Engelmore@SUMEX-AIM.ARPA, Lerman@SRI-KL.ARPA,
Genesereth@SUMEX-AIM.ARPA, Hart@SRI-AI.ARPA, JMC@SU-AI.ARPA,
Mcdermott@CMU-CS-A.ARPA, Reddy@CMU-CS-A.ARPA, Rich@MIT-MC.ARPA,
Stan@SRI-AI.ARPA, Stefik@XEROX.ARPA, Shortliffe@SUMEX-AIM.ARPA,
Tenenbaum@SRI-KL.ARPA, PHW@MIT-MC.ARPA
cc: AAAI-Office@SUMEX-AIM.ARPA
Telephone: (415) 328-3123
Postal-Address: 445 Burgess Drive, Menlo Park, CA 94025
This week the Strategic Planning Committee (composed of Nils
Nilsson,Allen Newell, Woody Bledsoe, Peter Hart, Lee Erman, Mike
Genesereth, Danny Bobrow, Ed Feigenbaum) endorsed Mark Stefik's
proposal which revised the current five day conference format. Of the
two proposed revisions presented by Mark, the second format was endorsed.
That format included the the following schedule:
Monday: Science Sessions, Applied Workshops, Popular Panels, Tutorials
Tuesday:Science Sessions, Applied Workshops, Popular Panels, Tutorials,
Exhibits
Wednesday: Panels, PRes. Address, Invited Talks, Banquet, Exhibits
Thursday: Science Workshops, Applied Sessions, Exhibits
Friday: Science Workshops, Applied Sessions
With the physical separation of the Applied Sessions, Tutorials and
Exhibits at the Philadelphia Civic Center and the Science Sessions
at the Franklin Plaza Hotel or the University of Penn and the
presence of an attractant (ie the Pop Panels), they believed
this proposed format will begin to address and help resolve some
of the expressed concerns about the conference.
Therefore, it is recommended to the Council members that they endorse
this particular format for 1986. If there is any objections to this
format, we would like to hear your comments by May 2. Otherwise, this
proposal will be go into immediate effect for 1986.
Thank you,
Claudia
-------
∂25-Apr-85 1202 VAL Circumscription Seminar
To: "@CS.DST[1,VAL]"@SU-AI.ARPA
Speaker: Vladimir Lifschitz
Topic: Closed-World Data Bases and Circumscription
Time: Wednesday, May 1, 2pm
Place: MJH301
∂25-Apr-85 1227 JMC
416 929 9471 Carol Ann Davidson, Canadian Broadcasting
∂25-Apr-85 1247 GENESERETH@SUMEX-AIM.ARPA my time
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 25 Apr 85 12:47:14 PST
Date: Thu 25 Apr 85 11:26:43-PST
From: Michael Genesereth <GENESERETH@SUMEX-AIM.ARPA>
Subject: my time
To: jmc@SU-AI.ARPA
John,
I just sent Nils a message reaffirming my policy of not spending
more tha one day every other week on non-Stanford activities.
mrg
-------
∂25-Apr-85 1312 U-REDDY@UTAH-20.ARPA Re: Your visit to Stanford
Received: from UTAH-20.ARPA by SU-AI.ARPA with TCP; 25 Apr 85 13:09:32 PST
Date: Thu 25 Apr 85 14:07:43-MST
From: Uday Reddy <U-REDDY@UTAH-20.ARPA>
Subject: Re: Your visit to Stanford
To: ash@SU-AI.ARPA
cc: U-REDDY@UTAH-20.ARPA, jmc@SU-AI.ARPA
In-Reply-To: Message from "Ashok Subramanian <ashok@SU-SUSHI.ARPA>" of Thu 25 Apr 85 11:34:18-MST
Dear Ashok,
Prof. Mc Carthy said he would get back to me about this schedule at the
beginning of this week. Since he did'nt, I assumed that it would'nt be
possible now.
Since I am leaving in just a few days, it is difficult to change my plans
at this stage. Can we schedule the visit to sometime after I get back from
my vacation? That would be after June 15.
Thank you.
Uday
-------
∂25-Apr-85 1311 RA PC Magazine
Stanford does not carry this magazine. UC Berkeley does. Do you want
me to try and get it for you?
∂25-Apr-85 1337 RA Message for David Chudnovsky
Your brother called. He is at Bashford Arms in SF. Tel: 673 2600 ext. 414.
The address is: 701 Post.
∂25-Apr-85 1343 ME military type
∂24-Apr-85 2336 JMC
Sometimes some random military type TALKs from Germany - he seems harmless.
ME - Yeah, thanks, I know about that guy. He does seem harmless except
for distracting logged in users with short meaningless messages.
∂25-Apr-85 1349 RA leave early
I am leaving early for my class.
∂25-Apr-85 1658 BRONSTEIN@SU-SCORE.ARPA "Terrorist" or "Rebel" ?
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 25 Apr 85 16:58:12 PST
Date: Thu 25 Apr 85 15:53:36-PST
From: Alexandre Bronstein <BRONSTEIN@SU-SCORE.ARPA>
Subject: "Terrorist" or "Rebel" ?
To: JMC@SU-AI.ARPA
cc: MOGUL@SU-SCORE.ARPA, su-bboards@SU-AI.ARPA, bronstein@SU-SCORE.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Mon 22 Apr 85 13:29:00-PST
It seems that these terms are loosing their value, as they become used
for propaganda purposes. This is unfortunate, because there are fundamental
moral differences between the two. As MacCarthy pointed the ambiguity,
here is my answer:
Terrorist: Someone who uses TERROR to gets his points accross. (Examples:
throwing babies outside hospital windows in front of their mothers,
hijacking a plane [full of civilians], randomly machine gunning
an airport waiting area, placing bombs in buses, etc...)
Rebel: someone who opposes the government. Fights against the ARMY of the
said government. (Usually able to defend itself, or supposed to.)
The difference:
NO MATTER THE CAUSE, terrorists are skunks which do not have (in my eyes)
the slighest amount of human values, and therefore should be dealt with
as such. Rebels may or may not be legitimate, they should be treated
as soldiers (prisonners of wars, etc...)
Alex
-------
∂26-Apr-85 0445 HST zehe eyc.
sorry,that i didn't answer on your query concerning this east german.
no, i newer knew him and newer heard of a professor of this name.it might
have happened after my time.
anything new with our ai confernce in september?can you give me a guess
how much i have to spend for you?
∂26-Apr-85 0900 JMC*
call chuck
∂26-Apr-85 1142 ASHOK@SU-SUSHI.ARPA Faculty candidate's visit postponed
Received: from SU-SUSHI.ARPA by SU-AI.ARPA with TCP; 26 Apr 85 11:41:49 PST
Date: Fri 26 Apr 85 11:41:20-PST
From: Ashok Subramanian <ashok@SU-SUSHI.ARPA>
Subject: Faculty candidate's visit postponed
To: nilsson@SU-SCORE.ARPA, papa@SU-SCORE.ARPA, yao@SU-SCORE.ARPA
cc: jmc@SU-AI.ARPA, ashok@SU-SUSHI.ARPA
Uday Reddy will not be able to visit us this coming Sunday and Monday as
originally planned.
He would like to visit us after his vacation in India, which means sometime
after June 15.
ashok
-------
∂26-Apr-85 1252 SHORTLIFFE@SUMEX-AIM.ARPA Re: Conference Proposals
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 26 Apr 85 12:51:56 PST
Date: Fri 26 Apr 85 12:43:47-PST
From: Ted Shortliffe <Shortliffe@SUMEX-AIM.ARPA>
Subject: Re: Conference Proposals
To: AAAI-OFFICE@SUMEX-AIM.ARPA
cc: Amarel@RUTGERS.ARPA, ai.woody@MCC.ARPA, Fikes@USC-ECL.ARPA,
Brachman@SRI-KL.ARPA, Buchanan@SUMEX-AIM.ARPA, Charniak@YALE.ARPA,
KRD@MIT-MC.ARPA, Engelmore@SUMEX-AIM.ARPA, Lerman@SRI-KL.ARPA,
Genesereth@SUMEX-AIM.ARPA, Hart@SRI-AI.ARPA, JMC@SU-AI.ARPA,
Mcdermott@CMU-CS-A.ARPA, Reddy@CMU-CS-A.ARPA, Rich@MIT-MC.ARPA,
Stan@SRI-AI.ARPA, Stefik@XEROX.ARPA, Tenenbaum@SRI-KL.ARPA, PHW@MIT-MC.ARPA
In-Reply-To: Message from "AAAI <AAAI-OFFICE@SUMEX-AIM.ARPA>" of Thu 25 Apr 85 11:54:51-PST
Office: Room TC-135, Stanford Med Center; Phone: (415) 497-6979
Claudia,
The modified Stefik plan makes alot of sense. It is worth a
try, and I support the proposal of the strategic planning committee.
Ted
-------
∂26-Apr-85 1332 YAO@SU-SCORE.ARPA interview
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 26 Apr 85 13:31:59 PST
Date: Fri 26 Apr 85 11:34:10-PST
From: Andrew Yao <YAO@SU-SCORE.ARPA>
Subject: interview
To: Nilsson@SU-SCORE.ARPA
cc: jmc@SU-AI.ARPA, ashok@SU-SUSHI.ARPA, papa@SU-SCORE.ARPA, yao@SU-SCORE.ARPA
Nils, some time ago you mentioned that after the Dean gave his approval,
we could then start interviewing people officially. Has that happened
yet? If so, I would like to start inviting some of the strong candidates.
In particular, Umesh Vazirani has been under pressure for deciding on a
faculty offer from CMU, and I would like to show him that we are still
interested in him. Personally, I feel that he is the most talented
theoretician in many many years, and I would not like to lose him without
us first seriously considering him.
--Andy
-------
∂26-Apr-85 1343 CLT
no supper tonite
∂26-Apr-85 1457 VAL
Feferman told me that Jager in Switzerland is interested in circumscription.
I'd like to send him a copy of your paper, if you don't mind. Please let me
know when it's ready.
∂26-Apr-85 1516 YOM Ph.D. Orals
To: herb@PSYCH, halpern.ibm-sj@CSNET-RELAY.ARPA, JMC@SU-AI.ARPA,
nilsson@SU-SCORE.ARPA, owicki@SU-SIERRA.ARPA,
yao@SU-SCORE.ARPA
CC: cheadle@SU-SCORE.ARPA
My oral exam is being scheduled for Wednesday, June 12th at 3:15pm.
You are a member of the orals committee, and as far as I understand
this time is compatible with your schedule. Please let me know if
it is not.
The running title of my dissertation is:
``Theories of Knowledge, Communication, and Concurrent Action''.
Yoram Moses
-----------------------------------------------------
-----------------------------------------------------
An abstract for the talk follows:
Reasoning about knowledge is a useful tool in the analysis of
many situations in computer science. Its importance has long been
recognized in Artificial Intelligence, and it is receiving fresh
interest in Distributed Systems and Cryptography. This work is an
attempt to understand and exploit the benefits of such reasoning.
We first briefly consider ways to model the knowledge and ignorance
of a computer-based system. Then, we look at the role knowledge
plays in a distributed environment of robots or computers in a network.
We argue that our understanding of distributed protocols is greatly
enhanced by considering how the communication involved changes the
state of knowledge of the agents involved. We consider the question
of what it means to say that a group of agents knows a fact p. We
present a hierarchy of states of knowledge for a group of agents, and
show the relevance of these notions to distributed computing.
Of special interest are the notion of implicit knowledge and common
knowledge. Common knowledge is an essential state of knowledge for
reaching agreement and coordinating action. We show that in practical
distributed systems, common knowledge is not attainable. We introduce
various relaxations of common knowledge that are attainable in many
cases of interest, and discuss in what sense these notions are
appropriate substitutes for common knowledge.
∂26-Apr-85 1558 LES
∂26-Apr-85 1545 RPG
∂26-Apr-85 1524 LES
∂26-Apr-85 1517 RPG
∂26-Apr-85 1503 LES Arbitrator
I discussed with Dave Schlager the idea of having access to escrow tapes
mediated by an independent. This idea seemed acceptable to him in
general. Assuming that suitable wording is negotiated, we nominate
Chris Goad as mediator if he is willing. What do you think of that?
Wrong! Guy L. Steele Jr. is who we'd nominate.
-rpg-
LES - Hmm. Does Steele owe you anything? If not, we agree.
Nothing. Plus he's the most honest person I know. He works at Thinking
Machines and has no interest in Lucid (or you for that matter).
-rpg-
∂26-Apr-85 1623 NILSSON@SU-SCORE.ARPA Re: interview
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 26 Apr 85 16:23:44 PST
Date: Fri 26 Apr 85 15:37:47-PST
From: Nils Nilsson <NILSSON@SU-SCORE.ARPA>
Subject: Re: interview
To: YAO@SU-SCORE.ARPA
cc: jmc@SU-AI.ARPA, ashok@SU-SUSHI.ARPA, papa@SU-SCORE.ARPA,
NILSSON@SU-SCORE.ARPA
In-Reply-To: Message from "Andrew Yao <YAO@SU-SCORE.ARPA>" of Fri 26 Apr 85 13:25:19-PST
Although I'm convinced that the slot your committee is working to fill
is solidly our slot, the H&S Deanery are currently unwilling to approve
official attempts to fill it pending the outcome of their discussions
with Engrg and with the provost about how our move to Engrg. affects
the slot situation in H&S. I'd like to be optimistic that these matters
will be settled soon, and I will agitate for getting them settled, I'm
not sure yet how things will turn out. Of course, we our perfectly
free to invite people to visit our department to give a seminar, etc.
We just have to be careful not to imply that we have official approval
to search yet nor are we "officially" interviewing. -Nils
-------
∂26-Apr-85 1638 VAL Full-time Appointment
Less Earnest says that I cannot get a formal offer until the process of review
is completed, which will take another week. I feel somewhat uncomfortable
about having to tell at San jose State that I'm leaving so close to the end of
the academic year. Are you 100% sure that there will be no problems, or
should I better wait until the appointment is formally approved?
∂26-Apr-85 1738 PALLAS@SU-SCORE.ARPA re: Sit in outside of Kennedy's office (from SAIL's BBOARD)
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 26 Apr 85 17:38:45 PST
Date: Fri 26 Apr 85 17:38:46-PST
From: Joseph I. Pallas <PALLAS@SU-SCORE.ARPA>
Subject: re: Sit in outside of Kennedy's office (from SAIL's BBOARD)
To: JMC@SU-AI.ARPA
cc: su-bboards@SU-SCORE.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Fri 26 Apr 85 14:53:00-PST
jmc - The indefinite continuation of such a protest is coercive and
immoral. The Stanford trustees are legally entitled to determine its
investment policy.
Is the first assertion supposed to follow from the second?
By the way, my dictionary defines "coerce" as "to compel by force,
intimidation, etc." Is a peaceful sit-down protest coercive? Only if
one chooses to be intimidated. Those with the courage of their
convictions should not find a peaceful protest coercive.
I don't really approve of the protest, but I do not think it is
coercive. Morality, of course, is a matter of personal values.
Legality and morality are distinct in our society. Many actions have
only one of the two attributes, but I will refrain from providing
inflammatory examples.
joe
-------
∂26-Apr-85 2034 LAMPING@SU-SCORE.ARPA Re: Steve Zucher
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 26 Apr 85 20:34:27 PST
Date: Fri 26 Apr 85 20:34:09-PST
From: John Lamping <LAMPING@SU-SCORE.ARPA>
Subject: Re: Steve Zucher
To: Nilsson@SU-SCORE.ARPA, Buchanan@SUMEX-AIM.ARPA, JMC@SU-AI.ARPA
cc: Bronstein@SU-SCORE.ARPA, bureaucrat@SU-SCORE.ARPA
Mail-From: BRONSTEIN created at 26-Apr-85 20:28:35
Date: Fri 26 Apr 85 20:28:35-PST
From: Alexandre Bronstein <BRONSTEIN@SU-SCORE.ARPA>
Subject: Re: Steve Zucker
To: bureaucrat@SU-SCORE.ARPA
cc: bronstein@SU-SCORE.ARPA
In-Reply-To: Message from "Student Bureaucrats <LAMPING@SU-SCORE.ARPA>" of Fri 26 Apr 85 19:53:16-PST
To: The Search Committee
Re: The hiring of Prof. Zucker in our department
I am not a Robotics student, but if I may, I would like to mention two
facts in favor of Prof. Steve Zucker's hiring in our department:
1) I went to his talk in CS300, and was very impressed by it. Even though
he was not as eloquent as some other speakers, I found his talk to be
the most enlightening and the most pleasant one I've attended in a very
long time (and I regularly attend many). To put it bluntly if I may, other
more eloquent speakers have often put me to sleep. Steve Zucker's talk
kept me captivated from the first second to the last.
As for his speech, I think anybody who would have an "interview" in front
of a couple hundred students and live on TV could easily be excused for
being nervous!
2) A couple of years ago, I was starting my Master's project here (in MTC)
in spring and happened to be spending the summer in Montreal.
At some point during the summer, I felt like starting to work on some actual
(LISP) coding, and therefore set out to gain access to some computer.
Being next to McGill University, I went down to their Computer Science dept
and boldly asked to be granted some kind of guest account on one of their
computers for the summer, for no good reason at all, except that I wanted
to try some things in LISP. Naturally, I was flatly rejected. But someone
pointed me to "some EE prof" who was doing "some AI work" and might be
agreeable.
Well, that prof was Steve Zucker. In a couple of minutes he gladly offered
me an account on his *overloaded* VAX780, on the condition that I be
"reasonable" about not logging in when too many people were on it. He
even offered me some pointers for getting started in LISP and on his VAX
and instructed his student-system-manager to help me out.
In other words he was very kind, and very willing to share whatever small
resources he had. He seemed to have an excellent relationship with his
students in his "vision lab".
In summary, I think he would be an outstanding addition to our Computer
Science Faculty.
Sincerely,
Alex Bronstein
-------
∂26-Apr-85 2056 RESTIVO@SU-SCORE.ARPA normal form for monadic formulas
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 26 Apr 85 20:56:04 PST
Date: Fri 26 Apr 85 20:56:31-PST
From: Chuck Restivo <RESTIVO@SU-SCORE.ARPA>
Subject: normal form for monadic formulas
To: JMC@SU-AI.ARPA
cc: Restivo@SU-SCORE.ARPA
[cwr] I have been working through Church's book to learn more
2nd order logic. I apologize for being out of touch
but I have been working on this. I'll need to run
some questions by you in a while before I sit down to
code.
Cheers!
-------
∂26-Apr-85 2244 POSER@SU-CSLI.ARPA re: Sit in outside of Kennedy's office (from SAIL's BBOARD)
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 26 Apr 85 22:44:04 PST
Date: Fri 26 Apr 85 22:43:25-PST
From: Bill Poser <POSER@SU-CSLI.ARPA>
Subject: re: Sit in outside of Kennedy's office (from SAIL's BBOARD)
To: JMC@SU-AI.ARPA
cc: OTHER-SU-BBOARDS@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Fri 26 Apr 85 14:53:00-PST
I would appreciate an explanation of the connection between the assertion
that "The indefinite continuation of such a protest is coercive and immoral."
and the subsequent assertion that "The Stanford trustees are legally entitled
to determine its investment policy." Do you intend to claim that any legal
action is moral? I certainly don't agree. Moreover, the whole point of the
protest is persuasion which is, to be sure, a mild form of coercion. But
what is to say that all forms of coercion are immoral?
-------
∂27-Apr-85 1303 CLT
how about no supper tonite and supper at home tomorrow?
∂27-Apr-85 1348 CLT
∂27-Apr-85 1323 JMC reply to message
[In reply to message rcvd 27-Apr-85 13:03-PT.]
That's fine. Got any special idea about tomorrow? I can try again
for smoked pork chops, but what if I fail?
--CLT--
What about sausages (+onion,mushroom,maybe zucchini..)
if there are no chops
∂28-Apr-85 1517 EDWARDS@SRI-AI.ARPA Cambodia, Vietnam, and Political Discussion
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 28 Apr 85 15:17:34 PDT
Date: Sun 28 Apr 85 15:17:40-PDT
From: EDWARDS@SRI-AI.ARPA
Subject: Cambodia, Vietnam, and Political Discussion
To: jmc@SU-AI.ARPA
I just caught up on the SCORE bboard today (Sunday) after having
ignored it for a while so as to get on with my work. I see that you
are engaged in a running battle with the local left. This brings to
mind a topic that I have recently been wondering about.
I recall that you mentioned at one point that the inhabitants of
Vietnam and Cambodia (presumably under the Vietnamese regime) have
lost the right to political freedom without having given up the right
to go hungry. If you can refer me to documentation of hunger in
Vietnam, or in Cambodia *after* the fall of Pol Pot, I will appreciate
it. I suspect that you may be right, but the most
authoritative-looking source on this topic that I can find is Michael
Vickery's *Cambodia: 1975-1982*. Vickery's footnotes are impressive,
but he belongs to the Noam Chomsky school of extreme leftism and I
cannot trust him without checking the footnotes. On the other hand, I
know of no equally scholarly work maintaining a contrary opinion (he
knows of, and severely criticizes, the book by Ponchaud).
Cordially,
Douglas Edwards
-------
∂28-Apr-85 1733 @RUTGERS.ARPA:MAILER-DAEMON@lbl-csam Returned mail: Host unknown
Received: from RUTGERS.ARPA by SU-AI.ARPA with TCP; 28 Apr 85 17:33:45 PDT
Received: from lbl-csam.ARPA by RUTGERS.ARPA with TCP; 28 Apr 85 20:34:01 EDT
Return-Path: <MAILER-DAEMON@lbl-csam>
Received: from RUTGERS.ARPA (rutgers.arpa.ARPA) by lbl-csam.ARPA ; Sun, 28 Apr 85 17:33:27 pdt
Date: 28 Apr 85 1732 PDT
From: (Mail Delivery Subsystem) MAILER-DAEMON@lbl-csam
Subject: Returned mail: Host unknown
Message-Id: <8504290033.AA28638@lbl-csam.ARPA>
To: <@RUTGERS.ARPA:JMC@SU-AI.ARPA>
----- Transcript of session follows -----
bad system name: "UW-BEA
uux failed. code 68
550 <\"UW-BEAVER!UBC-VISION!REITER\"@LBL-CSAM.ARPA>... Host unknown
----- Unsent message follows -----
Received: from RUTGERS.ARPA (rutgers.arpa.ARPA) by lbl-csam.ARPA ; Sun, 28 Apr 85 17:33:27 pdt
Message-Id: <8504290033.AA28636@lbl-csam.ARPA>
Received: from SU-AI.ARPA by RUTGERS.ARPA with TCP; 28 Apr 85 20:33:33 EDT
Date: 28 Apr 85 1732 PDT
From: John McCarthy <JMC@SU-AI.ARPA>
To: reiter@RUTGERS.ARPA
What is your current mailing address?
∂29-Apr-85 0722 @MIT-MC:RICH@MIT-OZ Conference Proposals
Received: from MIT-MC.ARPA by SU-AI.ARPA with TCP; 29 Apr 85 07:18:18 PDT
Received: from MIT-OZ by MIT-MC via Chaosnet; 29 APR 85 10:18:01 EDT
Date: 29 Apr 1985 10:18 EDT (Mon)
Message-ID: <RICH.12107014739.BABYL@MIT-OZ>
From: Charles Rich <RICH%MIT-OZ@MIT-MC.ARPA>
To: AAAI <AAAI-OFFICE@SUMEX-AIM.ARPA>
Cc: ai.woody@MCC.ARPA, Amarel@RUTGERS.ARPA, Brachman@SRI-KL.ARPA,
Buchanan@SUMEX-AIM.ARPA, Charniak@YALE.ARPA, Engelmore@SUMEX-AIM.ARPA,
Fikes@USC-ECL.ARPA, Genesereth@SUMEX-AIM.ARPA, Hart@SRI-AI.ARPA,
JMC@SU-AI.ARPA, KRD@MIT-MC.ARPA, Lerman@SRI-KL.ARPA,
Mcdermott@CMU-CS-A.ARPA, PHW@MIT-MC.ARPA, Reddy@CMU-CS-A.ARPA,
Shortliffe@SUMEX-AIM.ARPA, Stan@SRI-AI.ARPA, Stefik@XEROX.ARPA,
Tenenbaum@SRI-KL.ARPA
Subject: Conference Proposals
In-reply-to: Msg of 25 Apr 1985 14:50-EST from AAAI <AAAI-OFFICE at SUMEX-AIM.ARPA>
I think the committee's proposal is as good a plan as we are going to
get in advance of actually trying it out. We should all expect,
though, that there will have to be significant debugging in future
years until we get it right.
One small question: is two days for "Science Sessions" (which I
assume are the research papers) enough?
Finally, there is a point of terminology that strikes me oddly
in the proposal. I'd like to see if anyone else on the board
feels the same: The use of "Science" vs. "Applied" does not
seem like the right opposition -- shouldn't it be
"Research" vs. "Applications" ?
-Chuck.
∂29-Apr-85 0826 TULEY@SU-SCORE.ARPA telecommunication
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 29 Apr 85 08:25:55 PDT
Date: Mon 29 Apr 85 08:26:12-PDT
From: Kimberly Tuley <TULEY@SU-SCORE.ARPA>
Subject: telecommunication
To: ra@SU-AI.ARPA
cc: jmc@SU-AI.ARPA
Goodmorning,
There's a telecommunication for John McCarthy - phone 7-4081 and ask for
message #730.
Kim
-------
∂29-Apr-85 0850 SHORTLIFFE@SUMEX-AIM.ARPA Re: Conference Proposals
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 29 Apr 85 08:50:11 PDT
Date: Mon 29 Apr 85 08:44:53-PDT
From: Ted Shortliffe <Shortliffe@SUMEX-AIM.ARPA>
Subject: Re: Conference Proposals
To: RICH%MIT-OZ@MIT-MC.ARPA
cc: AAAI-OFFICE@SUMEX-AIM.ARPA, ai.woody@MCC.ARPA, Amarel@RUTGERS.ARPA,
Brachman@SRI-KL.ARPA, Buchanan@SUMEX-AIM.ARPA, Charniak@YALE.ARPA,
Engelmore@SUMEX-AIM.ARPA, Fikes@USC-ECL.ARPA, Genesereth@SUMEX-AIM.ARPA,
Hart@SRI-AI.ARPA, JMC@SU-AI.ARPA, KRD@MIT-MC.ARPA, Lerman@SRI-KL.ARPA,
Mcdermott@CMU-CS-A.ARPA, PHW@MIT-MC.ARPA, Reddy@CMU-CS-A.ARPA,
Stan@SRI-AI.ARPA, Stefik@XEROX.ARPA, Tenenbaum@SRI-KL.ARPA
In-Reply-To: Message from "Charles Rich <RICH%MIT-OZ@MIT-MC.ARPA>" of Mon 29 Apr 85 10:18:00-PDT
Office: Room TC-135, Stanford Med Center; Phone: (415) 497-6979
How about "Methodology" vs "Applications"? Those of us who do a
fair amount of applied work tend to think of it as being both "Science"
and "Research". It seems to me the distinction is between work directed
at developing new methods and fundamental insights as opposed to efforts
directed at applying existing methods in novel and creative ways in new task
domains.
Ted
-------
∂29-Apr-85 0850 EDWARDS@SRI-AI.ARPA re: Cambodia, Vietnam, and Political Discussion
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 29 Apr 85 08:50:31 PDT
Date: Mon 29 Apr 85 08:50:32-PDT
From: EDWARDS@SRI-AI.ARPA
Subject: re: Cambodia, Vietnam, and Political Discussion
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Sun 28 Apr 85 15:38:00-PDT
Thanks for your note about the Shawcross book. Keep up the good work
in speaking out on the BBoards; the intellectual atmosphere around
here does not exactly lend itself to objective attempts to get to the
bottom of the facts about things like the Indochina situation. People
often find it easier to read and talk ideology, and to wallow in
righteous indignation, than to research the facts.
-------
∂29-Apr-85 0905 Stefik.pa@Xerox.ARPA Re: Conference Proposals
Received: from XEROX.ARPA by SU-AI.ARPA with TCP; 29 Apr 85 09:05:08 PDT
Received: from Semillon.ms by ArpaGateway.ms ; 29 APR 85 09:01:00 PDT
Date: 29 Apr 85 09:00 PDT
From: Stefik.pa@Xerox.ARPA
Subject: Re: Conference Proposals
In-reply-to: Charles Rich <RICH%MIT-OZ@MIT-MC.ARPA>'s message of 29 Apr
85 10:18 EDT (Mon)
To: RICH%MIT-OZ@MIT-MC.ARPA
cc: AAAI-OFFICE@SUMEX-AIM.ARPA, ai.woody@MCC.ARPA, Amarel@RUTGERS.ARPA,
Brachman@SRI-KL.ARPA, Buchanan@SUMEX-AIM.ARPA, Charniak@YALE.ARPA,
Engelmore@SUMEX-AIM.ARPA, Fikes@USC-ECL.ARPA,
Genesereth@SUMEX-AIM.ARPA, Hart@SRI-AI.ARPA, JMC@SU-AI.ARPA,
KRD@MIT-MC.ARPA, Lerman@SRI-KL.ARPA, Mcdermott@CMU-CS-A.ARPA,
PHW@MIT-MC.ARPA, Reddy@CMU-CS-A.ARPA, Shortliffe@SUMEX-AIM.ARPA,
Stan@SRI-AI.ARPA, Stefik.PA@Xerox.ARPA, Tenenbaum@SRI-KL.ARPA
Chuck,
Two days is what we had last year, and we can presume that at least a
few of the papers would move to the applications part.
I agree with your "Science" -> "Research" name change.
Mark
∂29-Apr-85 0911 HEDGES@SU-SCORE.ARPA S. Zucker
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 29 Apr 85 09:10:56 PDT
Date: Mon 29 Apr 85 09:10:51-PDT
From: Karen Hedges <HEDGES@SU-SCORE.ARPA>
Subject: S. Zucker
To: Cannon@SU-SIERRA.ARPA, TOB@SU-AI.ARPA, JMC@SU-AI.ARPA,
Reynolds@SU-SCORE.ARPA, BScott@SU-SCORE.ARPA
cc: Hedges@SU-SCORE.ARPA
27-Apr-85 17:50:06-PST,3171;000000000001
Mail-From: NILSSON created at 27-Apr-85 17:50:05
Date: Sat 27 Apr 85 17:50:05-PST
From: Nils Nilsson <NILSSON@SU-SCORE.ARPA>
Subject: [John Lamping <LAMPING@SU-SCORE.ARPA>: Re: Steve Zucher]
To: hedges@SU-SCORE.ARPA
Karen, could you please forward this msg to the robotics search committee and
also give a copy to Betty Scott for the files? Thanks, -Nils
---------------
Mail-From: LAMPING created at 26-Apr-85 20:34:09
Date: Fri 26 Apr 85 20:34:09-PST
From: John Lamping <LAMPING@SU-SCORE.ARPA>
Subject: Re: Steve Zucher
To: Nilsson@SU-SCORE.ARPA, Buchanan@SUMEX-AIM.ARPA, JMC@SU-AI.ARPA
cc: Bronstein@SU-SCORE.ARPA, bureaucrat@SU-SCORE.ARPA
Mail-From: BRONSTEIN created at 26-Apr-85 20:28:35
Date: Fri 26 Apr 85 20:28:35-PST
From: Alexandre Bronstein <BRONSTEIN@SU-SCORE.ARPA>
Subject: Re: Steve Zucker
To: bureaucrat@SU-SCORE.ARPA
cc: bronstein@SU-SCORE.ARPA
In-Reply-To: Message from "Student Bureaucrats <LAMPING@SU-SCORE.ARPA>" of Fri 26 Apr 85 19:53:16-PST
To: The Search Committee
Re: The hiring of Prof. Zucker in our department
I am not a Robotics student, but if I may, I would like to mention two
facts in favor of Prof. Steve Zucker's hiring in our department:
1) I went to his talk in CS300, and was very impressed by it. Even though
he was not as eloquent as some other speakers, I found his talk to be
the most enlightening and the most pleasant one I've attended in a very
long time (and I regularly attend many). To put it bluntly if I may, other
more eloquent speakers have often put me to sleep. Steve Zucker's talk
kept me captivated from the first second to the last.
As for his speech, I think anybody who would have an "interview" in front
of a couple hundred students and live on TV could easily be excused for
being nervous!
2) A couple of years ago, I was starting my Master's project here (in MTC)
in spring and happened to be spending the summer in Montreal.
At some point during the summer, I felt like starting to work on some actual
(LISP) coding, and therefore set out to gain access to some computer.
Being next to McGill University, I went down to their Computer Science dept
and boldly asked to be granted some kind of guest account on one of their
computers for the summer, for no good reason at all, except that I wanted
to try some things in LISP. Naturally, I was flatly rejected. But someone
pointed me to "some EE prof" who was doing "some AI work" and might be
agreeable.
Well, that prof was Steve Zucker. In a couple of minutes he gladly offered
me an account on his *overloaded* VAX780, on the condition that I be
"reasonable" about not logging in when too many people were on it. He
even offered me some pointers for getting started in LISP and on his VAX
and instructed his student-system-manager to help me out.
In other words he was very kind, and very willing to share whatever small
resources he had. He seemed to have an excellent relationship with his
students in his "vision lab".
In summary, I think he would be an outstanding addition to our Computer
Science Faculty.
Sincerely,
Alex Bronstein
-------
-------
-------
∂29-Apr-85 0917 RA telex
The following is a telex for you from Wu Yunzeng from the Department of Computer
Science and Technology at Bejing University:
Will be available in the States by the end of April. Hope to visit Stanford
for 3 days preferably May 9 to May 11. Please arrange lodging for me if possible
(expenses will be taken care of by myself). Will contact you by phon upon arrival.
Wu Yunzeng.
22239 PKUNI CN
∂29-Apr-85 1006 RA Ray Caron
Ray Caron from Flexible Computer Corp. called (415) 593 7044; referal from DARPA.
∂29-Apr-85 1032 TULEY@SU-SCORE.ARPA message
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 29 Apr 85 10:32:45 PDT
Date: Mon 29 Apr 85 10:31:04-PDT
From: Kimberly Tuley <TULEY@SU-SCORE.ARPA>
Subject: message
To: jmc@SU-AI.ARPA
Hello,
Grant Fgermedal, the McMillan author, called - he says he will try to reach
you later today.
Kim
-------
∂29-Apr-85 1106 LES
To: JMC, RPG, CLT
∂29-Apr-85 1011 JMC
Please find out what he has to sell.
∂29-Apr-85 1006 RA Ray Caron
Ray Caron from Flexible Computer Corp. called (415) 593 7044; referal from DARPA.
-----------------
FCC is allegedly a two year old Dallas-based public corporation.
They have a multiprocessor system with a number of different internal busses
with transfer rates up to 48 megabytes/s and with uniform access times to memory.
Their product is aimed at realtime and scientific computing applications.
First delivery was December '84 and they allegedly have delivered about a
half-dozen systems, including one each to Purdue U. and NASA-Langley.
Their system currently uses 32032 processors. (They claim that no one else,
including Sequent, is delivering 32032-based systems yet.) They claim that
they will also support the 68020 and will demonstrate a mixed system (32032 &
and 68020) this summer.
They have three operating systems: Unix System V, MMOS, and Interim. We didn't
discuss that latter two much. They also have "concurrent" versions of C and
Fortran, effected by adding preprocessors to standard compilers. They expect
to have a concurrent ADA later this year.
Caron said that of the machines we are considering so far, they were most
like the Encore. I requested literature. They stand ready to tell us more.
One of the founders will be in this area next month and could be programmed
to visit.
∂29-Apr-85 1201 RA David Brock
David's address is: 29 downey Street, San Francisco, CA 94117. His tel.
759 9784.
∂29-Apr-85 1222 RA brachm.re1
There is no list of people in brachm.re1 only the body of the letter.
∂29-Apr-85 1244 RPG Flexible
To: LES, JMC, CLT
I've asked PMF about these folks. I'd rather not interview any
hardware vendors at the moment.
-rpg-
∂29-Apr-85 1250 CLT reply to reply to message
To: JMC
CC: LES, RPG, CLT
∂29-Apr-85 1235 JMC reply to message
To: LES, JMC, RPG, CLT
[In reply to message from LES rcvd 29-Apr-85 11:06-PT.]
I think we should tell Flexible that we don't want anything but literature
until DARPA reacts to our proposal. Does anyone have a different opinion?
---CLT---
And the people shouted quietly HOORAY!
∂29-Apr-85 1323 JMM The Swiss Approach- Applied consistently
To: su-bboards@SU-AI.ARPA
CC: JMC@SU-AI.ARPA
Assuming that JMC is implicitly supporting the `hands-off' approach
for South Africa, I wonder if consistency does not require opposing
US intervention in Nicaragua.
Jitendra Malik
∂29-Apr-85 1424 RA Ray Reiter
Ray is going to be in the university of BC still this month (the address in
your phon file). He is moving to University of Toronto in a month. His address
there will be: Computer Science Department, University of Toronto, Toronto,
Ontario, M5S 1A7. When he knows his now telephone and his new e-mail address
he will send you a message.
∂29-Apr-85 1446 RA Carolyn Davidson
Carolyn Davidson from the Canadian Broadcasting Corp. (416) 925 3311 ext. 4341
called re AAAS in LA.
∂29-Apr-85 1522 RA leave early
I am leaving early today for a doctor's appointment.
∂29-Apr-85 1546 AMAREL@RUTGERS.ARPA Re: Conference Proposals
Received: from RUTGERS.ARPA by SU-AI.ARPA with TCP; 29 Apr 85 15:46:25 PDT
Date: 29 Apr 85 18:40:45 EDT
From: AMAREL@RUTGERS.ARPA
Subject: Re: Conference Proposals
To: AAAI-OFFICE@SUMEX-AIM.ARPA
cc: ai.woody@MCC.ARPA, Fikes@USC-ECL.ARPA, Brachman@SRI-KL.ARPA,
Buchanan@SUMEX-AIM.ARPA, Charniak@YALE.ARPA, KRD@MIT-MC.ARPA,
Engelmore@SUMEX-AIM.ARPA, Lerman@SRI-KL.ARPA, Genesereth@SUMEX-AIM.ARPA,
Hart@SRI-AI.ARPA, JMC@SU-AI.ARPA, Mcdermott@CMU-CS-A.ARPA,
Reddy@CMU-CS-A.ARPA, Rich@MIT-MC.ARPA, Stan@SRI-AI.ARPA, Stefik@XEROX.ARPA,
Shortliffe@SUMEX-AIM.ARPA, Tenenbaum@SRI-KL.ARPA, PHW@MIT-MC.ARPA,
AMAREL@RUTGERS.ARPA
In-Reply-To: Message from "AAAI <AAAI-OFFICE@SUMEX-AIM.ARPA>" of 25 Apr 85 14:50:54 EST
I think that the Stefik modified proposal is a good one. We should try it.
However, the 'terminological' discussion which was started by Chuck is
indicative of a more fundamental issue which deserves our attention -
independently of the pragmatics of how to design a conference where workers
in the field can really interact with each other. Let me repeat something
that I said before in connection with the 2-conference proposal: It is too
early to draw a line between "research" and "applications"; the field will
continue to benefit from interactions between the two activities. The
distinctions between 'science vs applied', 'science vs engineering',
'research vs applications', 'pure vs applied', are far from conceptually
clean in the discipline at present. I agree with Ted's comment about the
research content in innovative/exploratory applications work. But, I have
difficulty with 'methodology vs applications' also. I suggest that we try
to avoid these dichotomies - at least publicly. We already have a good
number of de-facto technical partitions in the field - that any program
committee must take into consideration in its planning. Let the program
committee come up with an implementation of the Stefik proposal, consistent
with the spirit of the proposal (regarding distribution of kinds of activities
over the week), but without using the dichotomous labels in program announce-
ments. For example, use only session labels such as 'reasoning about
knowledge' and 'AI applications in geography'; and assign the first close
to Monday and the second close to Friday. Of course, for internal
purposes we can always use "research" and "applications" (with quotation
marks) to facilitate communications.
Saul
-------
∂29-Apr-85 1616 ullman@diablo Parallel Computing Center
Received: from SU-AIMVAX.ARPA by SU-AI.ARPA with TCP; 29 Apr 85 16:15:22 PDT
Date: Mon, 29 Apr 85 16:11:11 pdt
From: Jeff Ullman <ullman@diablo>
Subject: Parallel Computing Center
To: cheriton@pescadero, feigenbaum@sumex, golub@score, jlh@shasta, jmc@sail,
linton@sierra, mayr@diablo, owicki@sierra, papa@score, tob@sail
I've just been talking with Frank Kuo and Karl Levitt, and
they are enthusiastic about trying to make the parallel computing
center part of the SDI (Star Wars) initiative. There is a
May 31 deadline on white papers, and we intend to submit
something. There is, of course, the possibility that problems
with classified research will make this impossible, but Kuo
says the NY Times exaggerated the problem.
If anyone has problems with this course of action, I'll remove
your name and description of research from the white paper
sent to SDI, although I would like to send the white paper
to other potential sources with your names all included.
The idea is to have SDI be one of several funders of research
at the center ultimately; we still have hopes of GE involvement,
NSF, and perhaps others.
Oh yes, the SDI call for white papers asks for citations,
so if you would like to add a few references to your paragraph,
please message me by Friday.
∂29-Apr-85 1613 RTC Lisp Machines
I am not trying to stir things up, just get some information.
I understand that the 3600 whose console is in MJH360 is being
shared with Mike Genesereth's students until Mike's own machine
arrives from somwhere else. I want to use it for my programming
project, and I am starting to have trouble getting time on the
machine. Is there any way the other machine can be brought here
quicker?
Thanks,
Ross
∂29-Apr-85 1933 LES Lifschitz review
Betty Scott needs to invite faculty comment on Vladimir's proposed appointment.
Here is what was said the last time:
Dr. Lifschitz will work with Professor McCarthy on research concerning the
mathematical properties of circumscription.
Should something more/different be said this time?
∂30-Apr-85 0843 @MIT-MC:RICH@MIT-OZ Conference Proposals
Received: from MIT-MC.ARPA by SU-AI.ARPA with TCP; 30 Apr 85 08:42:57 PDT
Received: from MIT-OZ by MIT-MC via Chaosnet; 30 APR 85 11:43:05 EDT
Date: 30 Apr 1985 11:42 EDT (Tue)
Message-ID: <RICH.12107292300.BABYL@MIT-OZ>
From: Charles Rich <RICH%MIT-OZ@MIT-MC.ARPA>
To: AMAREL@RUTGERS.ARPA
Cc: AAAI-OFFICE@SUMEX-AIM.ARPA, ai.woody@MCC.ARPA, Brachman@SRI-KL.ARPA,
Buchanan@SUMEX-AIM.ARPA, Charniak@YALE.ARPA, Engelmore@SUMEX-AIM.ARPA,
Fikes@USC-ECL.ARPA, Genesereth@SUMEX-AIM.ARPA, Hart@SRI-AI.ARPA,
JMC@SU-AI.ARPA, KRD@MIT-MC.ARPA, Lerman@SRI-KL.ARPA,
Mcdermott@CMU-CS-A.ARPA, PHW@MIT-MC.ARPA, Reddy@CMU-CS-A.ARPA,
Shortliffe@SUMEX-AIM.ARPA, Stan@SRI-AI.ARPA, Stefik@XEROX.ARPA,
Tenenbaum@SRI-KL.ARPA
Subject: Conference Proposals
In-reply-to: Msg of 29 Apr 1985 18:40-EDT from AMAREL at RUTGERS.ARPA
Thank you to Saul for articulating the dichotomy issue and for the
suggestion that an explicit division into X vs Y *not* be written into
the conference brochure (perhaps just some comments about multiple
needs). I think some of the same feelings were what triggered my
terminological concern in the first place. (The idea of separate
registrations for two parts of the conference has been dropped,
right?)
-Chuck.
∂30-Apr-85 1142 KONOLIGE@SRI-AI.ARPA equality
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 30 Apr 85 11:41:50 PDT
Date: Tue 30 Apr 85 11:41:45-PDT
From: Kurt Konolige <Konolige@SRI-AI.ARPA>
Subject: equality
To: jmc@SU-AI.ARPA
cc: val@SU-AI.ARPA
John, here is a brief writeup of the equality claims. Other
people in the seminar may be interested, but I don't have the mailing
list.
Claim 1. Let P,Z be sets of predicates, and h a pure equality sentence
(the only predicate in h is equality, but fns and constants are allowed).
For any well-founded theory T (in the sense of Etherington et. al.),
T |= h iff Circum(T;P;Z) |= h.
Proof. Consider any model M of T, and let v be the truthvalue of h in
M. Any other model M' that has the same domain and denotation fn as M
also assigns h truthvalue v, because h is a pure equality sentence.
In particular, the P-minimal submodel of M (letting Z vary) is such an
M'. Hence h is true in all models of T iff it is true in all
P-minimal models of T; by a slight extension of Vladimir's Proposition
1 on the model theory of Cirumscription, the result follows.
The situation when Z can contain function vars is much harder to
characterize. However, the following example is interesting. Let
t1 and t2 be ground terms, and h the sentence t1=t2 or -(t1=t2).
Let R be a binary predicate not in Z or P, and let T be a well-founded
theory whose only sentence about R is Exy R(x,y) [i.e., some two
elements are related by R]. Then T |= h iff Circum(T;P;Z) |= h.
--kk
-------
∂30-Apr-85 1233 RA AI training
Paul Berry (415) 494 2031 called. Would like to find out about AI training.
∂30-Apr-85 1400 JMC
Ida lee
∂30-Apr-85 1916 YOM
I found registration forms. Thanks (an extra copy is on my desk). Yoram
∂01-May-85 1119 LIBRARY@SU-SCORE.ARPA SOCRATES conversion of Math/CS Library
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 1 May 85 11:19:29 PDT
Date: Wed 1 May 85 11:19:35-PDT
From: C.S./Math Library <LIBRARY@SU-SCORE.ARPA>
Subject: SOCRATES conversion of Math/CS Library
To: jmc@SU-AI.ARPA
I will have to look into the actual figures and get back to you about that.
However in terms of the number of records compared to the level of use it
probably wouldn't cost as much as some of the other collections in the
library. We advertise that we have 47,000 volumes but that is of course
books and journals. Our monographic collection should be between 25,000
and 30,000 volumes with that being approximately that many records needing
to be in SOCRATES. At the high end we may be talking about converting
20,000 records. The figure I don't have is the cost/per record for
conversion.
Harry
-------
∂01-May-85 1143 RA Carolyn Davidson called again
Carolyn Davidson from the Canadian Broadcasting Service called again re
AAAS. Her tel: (416) 929 9471.
∂01-May-85 1206 RA brachm.re1
I need the list for this letter.
Thanks.
∂01-May-85 1244 RA out for lunch
I am going out for lunch.
∂01-May-85 1520 ME NS wires up
∂30-Apr-85 2131 JMC Both wires are down
ME - They both came back up this morning. Probably the phone line or
carrier were failing somewhere outside of our facilities.
∂01-May-85 2038 ullman@diablo TR-903
Received: from SU-AIMVAX.ARPA by SU-AI.ARPA with TCP; 1 May 85 20:37:58 PDT
Date: Wed, 1 May 85 20:39:04 pdt
From: Jeff Ullman <ullman@diablo>
Subject: TR-903
To: jmc@sail
That has some very interesting ideas, although I quail at trying
to run a test for applicability of postponement in general.
I'm waiting to hear back from Joe Skudlarek that it's OK
to postpone his talk. I assume it is, but I think I ought
to wait as a courtesy. In fact, I'm expecting you to
talk on 5/8, and I'll announce that to the nail list.
∂02-May-85 0247 REGES@SU-SUSHI.ARPA Your SUSHI account
Received: from SU-SUSHI.ARPA by SU-AI.ARPA with TCP; 2 May 85 02:47:39 PDT
Date: Thu 2 May 85 02:46:16-PDT
From: Stuart Reges <REGES@SU-SUSHI.ARPA>
Subject: Your SUSHI account
To: JMC@SU-AI.ARPA
Your account name is MCCARTHY and your password is EXERT.
-------
∂02-May-85 0900 JMC
circum
∂02-May-85 1008 RA reminder
Nils wants to remind you that you are speaking at 11:00 today.
∂02-May-85 1031 RA talk
CS224 at Skilling Auditorium.
∂02-May-85 1042 RA Cuthbert Hurd
Cuthbert Hurd wants to remind you that he wants to buy you a high-priced
lunch today. 854-1901
∂02-May-85 1107 RA Sagem, France
Don Rondeau who is associated with a company called Sagem in France called.
A representative of the company and Prof. Latonde from The University of
Grenoble are going to be here in July (probably the week of the 4th) and
they would like to meet with you to discuss AI. Rondeau's telephone is
(603) 432 2013.
∂02-May-85 1300 JMC
Spectator to Dan.
∂02-May-85 1403 RA class
I am leaving for my class now. See you tomorrow.
∂02-May-85 1610 CL.SHANKAR@UTEXAS-20.ARPA Waiting to hear from Stanford
Received: from UTEXAS-20.ARPA by SU-AI.ARPA with TCP; 2 May 85 16:09:21 PDT
Date: Thu 2 May 85 18:10:04-CDT
From: CL.SHANKAR@UTEXAS-20.ARPA
Subject: Waiting to hear from Stanford
To: jmc@SU-AI.ARPA
cc: cl.shankar@UTEXAS-20.ARPA
I'm all ready and eager to visit Stanford, but haven't heard a word
from anyone about it. Any time this month is fine with me, but
the earlier the better, I would guess.
Shankar
-------
∂02-May-85 1718 CHASK@SU-SIERRA.ARPA asking advice on materials.
Received: from SU-SIERRA.ARPA by SU-AI.ARPA with TCP; 2 May 85 17:17:53 PDT
Date: Thu 2 May 85 17:17:52-PDT
From: Sang K. Cha <CHASK@SU-SIERRA.ARPA>
Subject: asking advice on materials.
To: jmc@SU-AI.ARPA
In your today's talk in CS224, you mentioned script representation of
knowledge. Could you please advise me some good papers on this topic
to start with ? I'm surveying knowledge representation techniques
as starting point for my PhD thesis work.
Thanks in advance.
Sang
-------
∂02-May-85 2027 CHASK@SU-SIERRA.ARPA re: asking advice on materials.
Received: from SU-SIERRA.ARPA by SU-AI.ARPA with TCP; 2 May 85 20:27:16 PDT
Date: Thu 2 May 85 20:27:31-PDT
From: Sang K. Cha <CHASK@SU-SIERRA.ARPA>
Subject: re: asking advice on materials.
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Thu 2 May 85 17:33:00-PDT
Thanks. That's what I wanted.
Sang
-------
∂02-May-85 2334 HST lisp-museum
hi john.i founded now the lisp musuem.the goal is to gather all books,manuals
and papers connected to lisp.
is there a way to recover deleted mail?
∂03-May-85 1032 CLT
no supper tonite
∂03-May-85 1309 JMC
true names
∂03-May-85 1649 VAL Circumscription seminar
To: "@CS.DST[1,VAL]"@SU-AI.ARPA
On May 8, at 2pm, John McCarthy will speak on "More Applications to AI".
As usual, we meet in MJH301.
∂04-May-85 1035 CLT
how about no supper tonight and supper at home tomorrow?
∂04-May-85 1304 MRC@SU-SCORE.ARPA Communism
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 4 May 85 13:04:05 PDT
Date: Sat 4 May 85 13:04:31-PDT
From: Mark Crispin <MRC@SU-SCORE.ARPA>
Subject: Communism
To: JMC@SU-AI.ARPA
cc: SU-BBoards@SU-SCORE.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Fri 3 May 85 21:04:00-PDT
Postal-Address: 725 Mariposa Ave. #103; Mountain View, CA 94041-1869
Phone: 1 (415) 968-1052
Several Italian cities have good examples of well-run
communist governments which are neither oppressive nor economic
failures. The same cannot be said for some other cites in the
same country.
I think it is a misnomer to call the government of Nicaragua
(the verdict isn't in yet) or the Allende government of Chile
communist. The current practice of calling Nicaragua's
government "communist" is quite recent (last couple of weeks);
previously, it was merely stated that some of its members were
avowed Marxists. It's obvious that we are being fed massive
doses of propaganda - Doc Goebbels would have been proud.
History clearly showed what happened when the US "liberated
Chile from communism". Earlier this week there was the travesty
of ol' Dick Nixon and Henry Kissinger, dug up from the rubbish
pile of history and completely unrepentant, on TV toeing Reagan's
party line during the press coverage of the 10th anniversary of
the fall of Saigon. The two men who were MOST responsible for
destabilizing a previously stable democracy are now advocating we
do the same to another Latin American nation. Too bad there is
no tribunal powerful enough to put former US leaders on trial for
war crimes.
What is the point of US foreign policy in Nicaragua? The US
is quite capable of making it worth the Sandanistas' while NOT to
get cozy with the USSR, NOT to cause trouble with neighboring
countries, etc... It's pretty obvious to me that the mere
existance of any leftist government in the Americas is in itself
infuriating to Reagan and his cronies.
I am not defending the Sandanistas; they seemed determined
to commit political suicide. Or, perhaps, they want to out-macho
Reagan. Only problem is, they don't have the muscle to win it,
and never will. Castro is militarily propped up (although he
seems to have enormous popular support) by the USSR at great
expense due to Cuba's extremely strategic location. I doubt the
USSR is going to invest similar sums for much less of a gain.
-------
∂04-May-85 1337 TREITEL@SU-SUSHI.ARPA re: Gay Blue Jeans Day--Monday, May 6 (from SAIL's BBOARD)
Received: from SU-SUSHI.ARPA by SU-AI.ARPA with TCP; 4 May 85 13:37:03 PDT
Date: Sat 4 May 85 13:36:46-PDT
From: Richard Treitel <TREITEL@SU-SUSHI.ARPA>
Subject: re: Gay Blue Jeans Day--Monday, May 6 (from SAIL's BBOARD)
To: JMC@SU-AI.ARPA
cc: OTHER-SU-BBOARDS@SU-AI.ARPA, treitel@SUMEX-AIM.ARPA, treitel@SU-SUSHI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Sat 4 May 85 02:26:00-PDT
I can satisfy JMC's curiosity on one point. Homosexuals in general are not
noticeably more aggressive than heterosexuals, at least according to the
samples of both populations that I have known. The sample sizes are large
enough for me to say this with some confidence.
At my previous university, a Gay Blue Jeans Day was met with a counter-
campaign, in which those who wished to signify their opposition to the idea
were asked to wear a sweater. In the local climate this was feasible. Rather
than suggest a California-compatible alternative, I'll just look for something
else to wear.
- Richard
-------
∂05-May-85 1806 ucscc!beeson%ucscd.ucscc.UUCP@Berkeley I'll be at Stanford 1-86 to 6-86
Received: from UCB-VAX.ARPA by SU-AI.ARPA with TCP; 5 May 85 18:06:15 PDT
Received: by UCB-VAX.ARPA (4.24/4.46)
id AA20932; Sun, 5 May 85 18:05:12 pdt
Received: from ucscd.UCSC (ucscd.ARPA) by ucscc.UCSC (4.12/4.7)
id AA10754; Sun, 5 May 85 11:02:17 pdt
Received: by ucscd.UCSC (4.12/4.7)
id AA08119; Sun, 5 May 85 11:00:09 pdt
Date: Sun, 5 May 85 11:00:09 pdt
From: ucscc!beeson%ucscd.ucscc.UUCP@Berkeley (20012000)
Message-Id: <8505051800.AA08119@ucscd.UCSC>
To: su-ai.jmc@Berkeley
Subject: I'll be at Stanford 1-86 to 6-86
Cc: beeson%ucscd.ucscc.UUCP@Berkeley
two days a week. Prof. Feferman has arranged
for me to give one lecture each quarter, in
winter on proof theory and in spring on constructive
mathematics. I expect to have some say about the
scheduling of the course and would like to make
sure I get the opportunity to attend your seminar
and/or possibly your course during those quarters.
Do you know yet what your schedule will be then?
∂05-May-85 1806 ucscc!beeson%ucscd.ucscc.UUCP@Berkeley comment on my work?
Received: from UCB-VAX.ARPA by SU-AI.ARPA with TCP; 5 May 85 18:06:11 PDT
Received: by UCB-VAX.ARPA (4.24/4.46)
id AA20927; Sun, 5 May 85 18:05:05 pdt
Received: from ucscd.UCSC (ucscd.ARPA) by ucscc.UCSC (4.12/4.7)
id AA10716; Sun, 5 May 85 10:59:49 pdt
Received: by ucscd.UCSC (4.12/4.7)
id AA08062; Sun, 5 May 85 10:57:41 pdt
Date: Sun, 5 May 85 10:57:41 pdt
From: ucscc!beeson%ucscd.ucscc.UUCP@Berkeley (20012000)
Message-Id: <8505051757.AA08062@ucscd.UCSC>
To: su-ai.jmc@Berkeley
Subject: comment on my work?
Cc: beeson%ucscd.ucscc.UUCP@Berkeley
I am preparing a paper on logic and knowledge representation.
I plan to contribute a talk based on it to the CSLI/ASL
conference at Stanford this summer. Would you be willing
to read and criticize a draft of the paper? I hope I will
have a draft which is at least somewhat comprehensible by
a week or two from now. It might take you a few hours
to read it, at least if I have succeeded to say something
novel it should. I am writing in advance because I suppose
you have summer travel plans and it might be difficult for
you to find even a few hours, but it would mean a lot to me
to have your criticism and advice, as this is my first
written venture into AI.
∂06-May-85 0211 HST lisp museum
i try to get every printed paper connected with lisp. in near future i expect
to complete a catalogue of all the memos and manuals i have already. i even
hope to get a cadr lisp machine which is not working for 1-2 years.
∂06-May-85 0900 JMC
Get pants.
∂06-May-85 0904 RG.JHM@Lindy
Received: from SU-LINDY.ARPA by SU-AI.ARPA with TCP; 6 May 85 09:04:21 PDT
Date: Mon, 6 May 85 09:04:40 PDT
From: John Merryman <RG.JHM@Forsythe>
To: JMC@SAIL
Professor McCarthy,
I owe you an apology (and said so to the Senate
after you left the meeting on Thursday). Although
your comments were out of order, I was needlessly
sharp dealing with the problem, particularly since
you had arrived after the discussion had begun and
could quite easily have mistaken the precise nature
of the topic. I could, and should, have handled it
better and regret any needless discomfiture I may have
caused you.
John Merryman
∂06-May-85 0919 HEDGES@SU-SCORE.ARPA Robotics Search Committee
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 6 May 85 09:18:59 PDT
Date: Mon 6 May 85 09:15:16-PDT
From: Karen Hedges <HEDGES@SU-SCORE.ARPA>
Subject: Robotics Search Committee
To: Cannon@SU-SIERRA.ARPA, TOB@SU-AI.ARPA, JMC@SU-AI.ARPA,
Reynolds@SU-SCORE.ARPA, BScott@SU-SCORE.ARPA, Nilsson@SU-SCORE.ARPA
REMINDER: There will be a Search Committee meeting at 4:00 today (May 6)
in the Chairman's Conference Room (MJH, Room 216).
-------
∂06-May-85 0935 ASHOK@SU-SUSHI.ARPA N.Shankar
Received: from SU-SUSHI.ARPA by SU-AI.ARPA with TCP; 6 May 85 09:35:51 PDT
Date: Mon 6 May 85 09:35:24-PDT
From: Ashok Subramanian <ashok@SU-SUSHI.ARPA>
Subject: N.Shankar
To: yao@SU-SCORE.ARPA, papa@SU-SCORE.ARPA, jmc@SU-AI.ARPA, nilsson@SU-SCORE.ARPA
cc: ashok@SU-SUSHI.ARPA
N.Shankar is one of the people we, the faculty search committee, would like
to have over here for a talk. He'd like to come over on Monday the 13th
of May.
I'd like to check your schedules to see when would be a nice time.
ashok
-------
∂06-May-85 1025 JJW Multilisp
To: JMC, CLT, LES, RPG
The VAX version of Halstead's Multilisp is running on Diablo and Navajo;
Byron Davies got the code from MIT for Diablo, and let me make a copy for
Navajo. If anyone is interested in trying it out, contact me.
I'm considering using Multilisp as a basis for my thesis work. It provides
essentially everything that I need in the way of statistics gathering for
simulated parallel execution of programs, and will let me concentrate on
parallelism detection.
It should also be possible to implement Qlambda in Multilisp. This will be
much slower than the eventual native-code compiler, of course, but perhaps
faster than the current simulators since Multilisp does "compile" Lisp code
into its internal Mcode.
Since the VAXes here often are heavily used, and since a VAX-780 isn't much
of a computer anyway, I'm going to try to port Multilisp to the S-1 Mark IIA,
which is now running Unix.
∂06-May-85 1347 RG.JHM@Lindy
Received: from SU-LINDY.ARPA by SU-AI.ARPA with TCP; 6 May 85 13:47:44 PDT
Date: Mon, 6 May 85 13:47:58 PDT
From: John Merryman <RG.JHM@Forsythe>
To: JMC@SAIL
John,
Thanks for the reply. I am relieved.
John
∂06-May-85 1536 RA brachm.re1
Do you have the AAAI directory? I am missing addresses for: Ron Brachman,
Henry Kaufman, and Mike Morgan.
∂06-May-85 1718 DAVIES@SUMEX-AIM.ARPA Wednesday meeting -- 9 am
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 6 May 85 17:17:45 PDT
Date: Mon, 6 May 1985 17:17 PDT
Message-ID: <DAVIES.12108958753.BABYL@Sumex>
From: DAVIES@Sumex
To: AAP@Sumex, JMC@SAIL, JJW@SAIL, CLT@SAIL
Subject: Wednesday meeting -- 9 am
Byron will describe "The QLambda Experiments". There are now 4
working implementations of QLambda, with a 5th and 6th in the works.
Come find out why, how, and what's next.
-- Byron
∂06-May-85 1802 CL.BOYER@UTEXAS-20.ARPA bibliography
Received: from UTEXAS-20.ARPA by SU-AI.ARPA with TCP; 6 May 85 18:02:21 PDT
Date: Mon, 6 May 1985 20:03 CDT
From: CL.BOYER@UTEXAS-20.ARPA
To: jmc@su-ai
Subject: bibliography
Could you please send me a list of your publications?
See you later this month at MCC.
∂06-May-85 2206 ullman@diablo next meeting
Received: from SU-AIMVAX.ARPA by SU-AI.ARPA with TCP; 6 May 85 22:06:01 PDT
Date: Mon, 6 May 85 22:05:45 pdt
From: Jeff Ullman <ullman@diablo>
Subject: next meeting
To: jmc@sail, nail@diablo
This Wednesday 5/8, John McCarthy will talk about
control algorithms for logic.
Joe Skudlarek's talk about *QUEL (or is it QUEL*) will be
given next week, 5/15.
∂07-May-85 1111 JMC
Goguen.
∂07-May-85 1111 JMC
mcginn
∂07-May-85 1125 VAL modularization of circumscription
I have a nice syntactic condition under which circ'n can be modularized. I'd
like to show it to you when you have a minute.
∂07-May-85 1143 RA Prof. Wu
Victor wanted me to let you know that Wu is coming in tonight. Can you meet
Wu at 11:00am Thursday? Also, how about dinner Thur. night? Victor will take
care of Wu's accommodations.
∂07-May-85 1328 RA Joseph Goguen
Returned your call. (415) 859 5454.
∂07-May-85 1337 CLT
no supper
∂07-May-85 1916 GSF Common-Sense Summer
To: JMC
CC: GSF
Tomorrow morning I will meet with Jerry Hobbs at SRI to talk about his
common-sense summer. I appreciate your suggesting Hobbs to me. I also
want to thank you for the time you have made to talk with me on three
occasions. You are an enjoyable person to converse with.
--Grant Fjermedal
∂08-May-85 0150 NORMAN@SRI-AI.ARPA Files archived from directory <PS:<COMMONSENSE>>
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 8 May 85 01:50:23 PDT
Date: 8 May 1985 0139-PDT
From: Norman at SRI-SPRM.ARPA
Subject: Files archived from directory <PS:<COMMONSENSE>>
To: COMMONSENSE
COMMONSENSE.PEOPLE.3 1 page
1 file 1 page
-------
∂08-May-85 0622 YAO@SU-SCORE.ARPA Re: Scherlis
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 8 May 85 06:22:36 PDT
Date: Tue 7 May 85 19:29:49-PDT
From: Andrew Yao <YAO@SU-SCORE.ARPA>
Subject: Re: Scherlis
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Sun 5 May 85 14:12:00-PDT
John, I'll be glad to consider him. When we have enough new information about new candidates, perhaps we should have another committee meeting to discuss
it.
--Andy
-------
∂08-May-85 0928 GANGOLLI@SU-SCORE.ARPA late visitor
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 8 May 85 09:22:26 PDT
Date: Wed 8 May 85 09:22:10-PDT
From: Anil Gangolli <GANGOLLI@SU-SCORE.ARPA>
Subject: late visitor
To: jmc@SU-AI.ARPA, feigenbaum@SUMEX-AIM.ARPA
cc: GANGOLLI@SU-SCORE.ARPA
Tom Strat, a newly admitted PhD student, would like to meet with each
of you. Please send me a list of times when it would be convenient for
you to meet him. He works at SRI, so he can come by on most days of
the week, but Mondays and Wednesdays are better for him. --anil.
-------
∂08-May-85 1032 VAL paper on applications of circ'n
In connection with the changes you made in the first paragraph of Section 13
(where you mention my work), the last sentence of the paragraph should be
deleted.
∂08-May-85 1154 RA lunch
Going out for lunch; will be back in about an hour.
∂08-May-85 1548 RA Electronics Week Magazine
John King from Electronic Week Magazine called re: an article they are
writing. His phone: (212) 512 2133. He would like you to call him.
∂08-May-85 1632 DAVIES@SUMEX-AIM.ARPA AAP@SUMEX Mailing List
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 8 May 85 16:32:48 PDT
Date: Wed, 8 May 1985 16:32 PDT
Message-ID: <DAVIES.12109474897.BABYL@Sumex>
From: DAVIES@Sumex
To: Les@SAIL, JMC@SAIL, JJW@SAIL, CLT@SAIL
Subject: AAP@SUMEX Mailing List
cc: Davies@Sumex
I've added you to the Advanced Architectures Project mailing list
(AAP@SUMEX) so that you will be notified of the topic of our weekly
meeting. This has been a low volume mailing list -- an average of
about 1.5 messages per week -- so you needn't worry about information
overload from this source. Let me know, however, if you ever want to
be removed.
-- Byron
∂08-May-85 1741 JF@SU-SUSHI.ARPA milk
Received: from SU-SUSHI.ARPA by SU-AI.ARPA with TCP; 8 May 85 17:41:40 PDT
Date: Wed 8 May 85 17:41:18-PDT
From: Joan Feigenbaum <JF@SU-SUSHI.ARPA>
Subject: milk
To: jmc@SU-AI.ARPA
I sent thomas maslen out in search of a real cow.
-------
∂08-May-85 1831 DAVIES@SUMEX-AIM.ARPA AAP meeting
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 8 May 85 18:31:29 PDT
Date: Wed, 8 May 1985 18:31 PDT
Message-ID: <DAVIES.12109496582.BABYL@Sumex>
From: DAVIES@Sumex
To: John McCarthy <JMC@SU-AI.ARPA>
Cc: Davies@Sumex
Subject: AAP meeting
In-reply-to: Msg of 8 May 1985 17:29-PDT from John McCarthy <JMC at SU-AI.ARPA>
Thanks for your comments on today's meeting. I would be happy to talk
more about directions for QLISP. Pick a time Thursday afternoon or
Friday or early next week and I'll come over to your office.
Also, I will change your AAP address to be JMC-LISTS@SAIL.
-- Byron
∂09-May-85 0905 RA [Reply to message recvd: 09 May 85 00:48 Pacific Time]
Reservation taken care of.
∂09-May-85 0922 ASHOK@SU-SUSHI.ARPA N. Shankar's visit
Received: from SU-SUSHI.ARPA by SU-AI.ARPA with TCP; 9 May 85 09:22:19 PDT
Date: Thu 9 May 85 09:21:59-PDT
From: Ashok Subramanian <ashok@SU-SUSHI.ARPA>
Subject: N. Shankar's visit
To: jmc@SU-AI.ARPA, yao@SU-SCORE.ARPA, nilsson@SU-SCORE.ARPA, papa@SU-SCORE.ARPA
cc: ashok@SU-SUSHI.ARPA
Natarajan Shankar from the University of Texas at Austin will be with us
Monday, May 13. His talk is scheduled for 11 am in MJ 301, and he has an
appointment with Prof. Nilsson at 2:30 pm.
ashok
-------
∂09-May-85 0935 ASHOK@SU-SUSHI.ARPA Re: N. Shankar's visit
Received: from SU-SUSHI.ARPA by SU-AI.ARPA with TCP; 9 May 85 09:34:52 PDT
Date: Thu 9 May 85 09:34:32-PDT
From: Ashok Subramanian <ashok@SU-SUSHI.ARPA>
Subject: Re: N. Shankar's visit
To: jmc@SU-AI.ARPA, nilsson@SU-SCORE.ARPA, papa@SU-SCORE.ARPA, yao@SU-SCORE.ARPA
cc: ashok@SU-SUSHI.ARPA
In-Reply-To: Message from "Ashok Subramanian <ashok@SU-SUSHI.ARPA>" of Thu 9 May 85 09:22:00-PDT
Oops.. I forgot the abstract; here it is..
A MECHANICAL PROOF OF THE CHURCH-ROSSER THEOREM
N. Shankar
The University of Texas at Austin
Abstract: The talk outlines a formalization and proof of the
Church-Rosser theorem that was carried out with the Boyer-Moore theorem
prover. This celebrated theorem on the Lambda Calculus lacked a widely
accepted proof for over thirty years. The mechanical proof is based on
that of Tait and Martin-Lof. The proof illustrates the effective use
of the Boyer-Moore theorem prover in checking difficult metamathematical
proofs. The above proof effort led to a much clearer understanding of
the proof and brought certain representational issues to light. No
familiarity with the Boyer-Moore theorem prover or Lambda Calculus will
be assumed.
-------
∂09-May-85 1034 NILSSON@SU-SCORE.ARPA Liskov
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 9 May 85 10:34:21 PDT
Date: Thu 9 May 85 10:32:29-PDT
From: Nils Nilsson <NILSSON@SU-SCORE.ARPA>
Subject: Liskov
To: jmc@SU-AI.ARPA
cc: nilsson@SU-SCORE.ARPA
John, What's your opinion of Barbara Liskov as a possible
Forsythe lecturer? -Nils
-------
∂09-May-85 1109 JF@SU-SUSHI.ARPA milk
Received: from SU-SUSHI.ARPA by SU-AI.ARPA with TCP; 9 May 85 11:09:46 PDT
Date: Thu 9 May 85 11:07:13-PDT
From: Joan Feigenbaum <JF@SU-SUSHI.ARPA>
Subject: milk
To: jmc@SU-AI.ARPA
there is milk on the door of refrigerator, lowest shelf. help yourself.
-------
∂09-May-85 1300 thh@diablo Elod Knuth
Received: from SU-AIMVAX.ARPA by SU-AI.ARPA with TCP; 9 May 85 13:00:23 PDT
Date: Thu, 9 May 85 12:59:59 pdt
From: Thanasis Hadzilacos <thh@diablo>
Subject: Elod Knuth
To: jmc@sail
Mr Elod Knuth from the Computer and Automation Institute
in Budapest, Hungary is at Stanford giving a lecture
in the Database Research Seminar. He would like to have
a discussion with you sometime tomorrow or
today if possible. He is available anytime except
tomorrow at 11-11:30 and 15:00-16:30.
You can answer to my address (thh@diablo) or he can
call you later to see if you will be available.
Thanasis Hadzilacos
∂09-May-85 1418 RA leave early
I am leaving for my class now. See you tomorrow.
∂09-May-85 1814 GSF Thanks
To: JMC
CC: GSF
Friday morning I head home to Seattle. I have enjoyed my stay
at Stanford. Thanks for spending time talking with me about
your work. I was impressed to see that Hobbs had dedicated his
book to you.
--Grant Fjermedal
∂09-May-85 1852 ASHOK@SU-SUSHI.ARPA [CL.SHANKAR@UTEXAS-20.ARPA: Re: Schedule, May 13, Monday]
Received: from SU-SUSHI.ARPA by SU-AI.ARPA with TCP; 9 May 85 18:52:50 PDT
Date: Thu 9 May 85 18:52:32-PDT
From: Ashok Subramanian <ashok@SU-SUSHI.ARPA>
Subject: [CL.SHANKAR@UTEXAS-20.ARPA: Re: Schedule, May 13, Monday]
To: jmc@SU-AI.ARPA
cc: ashok@SU-SUSHI.ARPA
What can we do about this ?
ashok
---------------
Return-Path: <CL.SHANKAR@UTEXAS-20.ARPA>
Received: from UTEXAS-20.ARPA by SU-SUSHI.ARPA with TCP; Thu 9 May 85 18:42:03-PDT
Date: Thu 9 May 85 20:43:12-CDT
From: CL.SHANKAR@UTEXAS-20.ARPA
Subject: Re: Schedule, May 13, Monday
To: ashok@SU-SUSHI.ARPA
In-Reply-To: Message from "Ashok Subramanian <ashok@SU-SUSHI.ARPA>" of Thu 9 May 85 11:17:56-CDT
I plan to fly out tomorrow evening, spend the weekend with some friends
in the SF area, and come into Stanford sunday evening. Where will I be
staying? Also, if my schedule requires me to spend tuesday visiting the
dept., I'll need a place to stay for Monday night. I'll ask Waldinger
if SRI can pay for the accomodation for Tuesday night and have him contact
you. Otherwise, I got enough friends in the region and can survive.
All this sounds very complicated. Can you give me a phone number
so I can contact you in case there is a problem?
Shankar
-------
-------
∂10-May-85 0851 M.SUSAN@SU-SIERRA.ARPA [Bernard←Galler%UMich-MTS.Mailnet@MIT-MULTICS.ARPA:]
Received: from SU-SIERRA.ARPA by SU-AI.ARPA with TCP; 10 May 85 08:47:54 PDT
Date: Fri 10 May 85 08:48:07-PDT
From: Susan Gere <M.SUSAN@SU-SIERRA.ARPA>
Subject: [Bernard←Galler%UMich-MTS.Mailnet@MIT-MULTICS.ARPA:]
To: jmc@SU-AI.ARPA, nilsson@SU-SCORE.ARPA
Return-Path: <@MIT-MULTICS.ARPA:Bernard←Galler@UMich-MTS.Mailnet>
Received: from MIT-MULTICS.ARPA by SU-SIERRA.ARPA with TCP; Thu 9 May 85 11:18:00-PDT
Received: from UMich-MTS.Mailnet by MIT-MULTICS.ARPA with Mailnet id <2661963104949656@MIT-MULTICS.ARPA>; 09 May 1985 14:11:44 edt
Date: Thu, 9 May 85 11:24:54 EDT
From: Bernard←Galler%UMich-MTS.Mailnet@MIT-MULTICS.ARPA
To: m@su-sierra.arpa
Message-ID: <765077@UMich-MTS.Mailnet>
Mike - I don't have net addresses for John McCarthy and Nils Nilsson.
Could you please pass on the messages below to them and maybe send me
their net addresses so I don't have to bother you again? Thank you very
much. And thanks for sending that stuff on the music activity. It will
be helpful here.
John - Phyllis of Omega Travel has been trying to reach you about travel
arrangements for the Japan trip. Please call her right away at
1-800-828-2323. Bernie Galler
Nils - Phyllis of Omega Travel mentioned to me that you are now planning
to arrive in Tokyo on June 18. That means that you will miss most of the
first day of the seminar and maybe not connect with us for the
buses to Numazu, where the rest of the seminar will take place.
Did you mean to arrange it that way? If not, please call Phyllis
at 1-800-828-2323. Bernie Galler
-------
∂10-May-85 1012 VAL moving blocks
I think I have a solution. I'll be on campus until 12:30 and then on Monday
from 10 to 3.
∂10-May-85 1020 GANGOLLI@SU-SCORE.ARPA [Anil Gangolli <GANGOLLI@SU-SCORE.ARPA>: late visitor]
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 10 May 85 10:20:46 PDT
Date: Fri 10 May 85 10:21:15-PDT
From: Anil Gangolli <GANGOLLI@SU-SCORE.ARPA>
Subject: [Anil Gangolli <GANGOLLI@SU-SCORE.ARPA>: late visitor]
To: jmc@SU-AI.ARPA, feigenbaum@SUMEX-AIM.ARPA
If you are too busy to meet with Tom, please reply to that effect.
See below. --anil.
---------------
Mail-From: GANGOLLI created at 8-May-85 09:22:10
Date: Wed 8 May 85 09:22:10-PDT
From: Anil Gangolli <GANGOLLI@SU-SCORE.ARPA>
Subject: late visitor
To: jmc@SU-AI.ARPA, feigenbaum@SUMEX-AIM.ARPA
cc: GANGOLLI@SU-SCORE.ARPA
Tom Strat, a newly admitted PhD student, would like to meet with each
of you. Please send me a list of times when it would be convenient for
you to meet him. He works at SRI, so he can come by on most days of
the week, but Mondays and Wednesdays are better for him. --anil.
-------
-------
∂10-May-85 1115 CLT
no supper tonite
∂10-May-85 1607 LES Signature
I need yours.
∂10-May-85 1734 PARK@SRI-AI.ARPA AUSSIE PARTY!!!
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 10 May 85 17:34:24 PDT
Date: Fri 10 May 85 17:22:20-PDT
From: Bill Park <PARK@SRI-AI.ARPA>
Subject: AUSSIE PARTY!!!
To: PARTY-PEOPLE: ;
INVEETEYETION TO THE
1ST ANNUAL AUSSIE APPRECIEYETION PARTY
-- OR --
BEER 'N PRAWNS NIGHT IN MENLO PARK
| | |O<--Bill Park's station (3rd on right) | SA'URDYE
| | |O 1430 Mills Court, Menlo Park | MYE 18
| + |O (415) 326-6369 | noon-6pm
E |--|--+---+-------------------------------------| M
l | | |M |L Glenwood Ave | i POT LUCK
| +S |i |a | d POT LUCK
C | |P |l |u | d POT LUCK
a | + |l |r | l POT LUCK
m | | |s |e | e POT LUCK
i | + | |l Oak Grove Ave | f POT LUCK
n |--|--+---+-------------------------------------| i POT LUCK
o | +t |S | e POT LUCK
| |r |t | l POT LUCK
R | +a |r | d POT LUCK
e | |c |e | POT LUCK
a | +k |e | R POT LUCK
l | |s |t Ravenswood Ave | d POT LUCK
|--|------+-------------------------------------| POT LUCK
| | | ** SRI ** |
'Right, cobber, ter meyekit simple, THIS time we'll use the Strylian
method: every bloke, bird, or famly group brings a myne course (I
mean REAL DINKUM FOOD, this time, you lot!) and TWO or more of the
following ...
(1) A 20th-century artyfac illustryting a meyejor
Strylian non-alcoholic contrybution to world culture.
(2) A kangaroo, wallaby, platypus, koala (NOT the computer
peripheral), echidna, dingo, kookaburra, great auk, jumbuck,
wombat, or sheep. Either bring a live one or stuff it
(please yourself). This item does not count as a myne
course or in category (1)---except the sheep, of course,
but only if properly prepared, and if not attending as a
significant other.
(3) A digireedoo, bullroarer, boomerang, ostrich egg
water cache, coprolith, billabong, or other
authentic prehistoric aboriginal tourist junk.
(4) Ayers' rock. The whole rock---this is not goin' ter
be one of those easy bloody California parties!
(5) A Strylian lifeguahd, in uneefohm, skiff optional.
The site of the 'ost's future 'ot tub will be myde
avylible for life-syvin' demonstrytions.
(6) The 'Merica's Cup, or, fylin' that, the Lit'l
'Merica's Cup
(7) A member of the Philosophy Depahtment of the
Universty of Wooloomooloo, myle or feemyle only, but
in authentic academic regylia, nymed Bruce.
Lessons in speakin' Stryne prop'ly will be provided for foreigners
and natives oo've been in the Stytes too long. For the former, a
viewin' of "Don's Party" is strongly recommended as preparytion
against excessive culture shock. Digger Bill will supply the
amenities---barbie, rabbit food, sweets, and probably a 10 or 20 of
Foster's, Tooth, Cascade, XXXX, VB, Resche's, Toowey's, and Black &
Tan, to start. We'll also 'ave Toowey's with a dash, and Bacardi &
Cokes for the birds. After the pi**-up, we'll bring our steins out
on the bloody front lawn, and 'ave a bloody good cricket match,
Aussie rules, 'gainst the 'ole bloody VFL, oo'l be 'specially
imported, at tremedjis expense, just for this one bleedin' after.
Li'l blokes an' birds're welcome, if they can stand it.
Apologies for the cock-up with the mailing before. Won't 'appen
again. ---Bill (Bruce) Park.
-------
∂11-May-85 1509 CLT
i don't think i'm going feel like going to supper
∂12-May-85 1031 GENESERETH@SUMEX-AIM.ARPA ai qual
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 12 May 85 10:31:44 PDT
Date: Sun 12 May 85 10:31:17-PDT
From: Michael Genesereth <GENESERETH@SUMEX-AIM.ARPA>
Subject: ai qual
To: tob@SU-AI.ARPA, buchanan@SUMEX-AIM.ARPA, feigenbaum@SUMEX-AIM.ARPA,
jmc@SU-AI.ARPA, nilsson@SU-SCORE.ARPA, tw@SU-AI.ARPA
cc: genesereth@SUMEX-AIM.ARPA
Gentlemen,
This year the job or organizing the ai qual has fallen to me. I
have tentatively scheduled the qual for th week after finals
week, i.e. one of te days from June 17-June 21. Could you please
let me know if there are any days that week that are impossible for you
so that I can schedule the exam more precisely. Thanks.
mrg
-------
∂12-May-85 1748 NILSSON@SU-SCORE.ARPA Re: ai qual
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 12 May 85 17:48:45 PDT
Date: Sun 12 May 85 17:49:08-PDT
From: Nils Nilsson <NILSSON@SU-SCORE.ARPA>
Subject: Re: ai qual
To: GENESERETH@SUMEX-AIM.ARPA
cc: tob@SU-AI.ARPA, buchanan@SUMEX-AIM.ARPA, feigenbaum@SUMEX-AIM.ARPA,
jmc@SU-AI.ARPA, tw@SU-AI.ARPA, NILSSON@SU-SCORE.ARPA
In-Reply-To: Message from "Michael Genesereth <GENESERETH@SUMEX-AIM.ARPA>" of Sun 12 May 85 10:35:13-PDT
I'm scheduled toe in Japan that week. Could it be during the regular
spring quarter? (Shouldn't it be during the regulaspring quarter?) -Nils
-------
∂13-May-85 0930 BACH@SU-SCORE.ARPA re: Chile and non-obnoxious communist governments (from SAIL's BBOARD)
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 13 May 85 09:20:38 PDT
Date: Mon 13 May 85 09:04:31-PDT
From: Rene Bach <BACH@SU-SCORE.ARPA>
Subject: re: Chile and non-obnoxious communist governments (from SAIL's BBOARD)
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Wed 8 May 85 22:30:00-PDT
This is not at all what was said in Europe at the time. Where else did
Pinochet get support from ? Don't be blind. Information in this country
is VERY partial. There is a lot of very subtle indoctrination happening in
this country (US).
Rene
-------
∂13-May-85 1113 RA [Reply to message recvd: 12 May 85 19:20 Pacific Time]
Is it by any chance Roger Boyer from SLAC? If not, where is he from?
Thanks,
∂13-May-85 1424 VAL seminar
Rutie says it looks like you're going to be out of town each Wednesday until
the end of May, but she suggested that I check with you. Since we don't have
that much to talk about at this time, it seems there's nothing wrong with
postponing the next seminar until June. What do you think?
∂13-May-85 1729 CLT
if we don't go out with shankar to nite i'd rather not go to supper
∂13-May-85 1822 ME delayed mail
∂13-May-85 1757 JMC
Why should it take 20 minutes for MAIL JMC from CLT to arrive?
ME - The remind phantom might have been busy for that long with
a backlog of network mail. Or possibly you might have had your
mail file open at exactly the moment the mail was attempted.
Of course, you'd get a "being queued" message on the first such
busy-file delivery attempt for the message.
∂14-May-85 0716 JOHN@SU-CSLI.ARPA Re: selling time
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 14 May 85 07:16:23 PDT
Date: Tue 14 May 85 07:13:16-PDT
From: John Perry <JOHN@SU-CSLI.ARPA>
Subject: Re: selling time
To: JMC@SU-AI.ARPA
cc: JOHN@SU-CSLI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Mon 13 May 85 23:01:00-PDT
Thanks for the idea.
-------
∂14-May-85 0915 LINDSTROM@UTAH-20.ARPA Re: visit
Received: from UTAH-20.ARPA by SU-AI.ARPA with TCP; 14 May 85 09:15:33 PDT
Date: Tue 14 May 85 10:14:43-MDT
From: Gary Lindstrom <Lindstrom@UTAH-20.ARPA>
Subject: Re: visit
To: YM@SU-AI.ARPA
cc: jmc@SU-AI.ARPA, ullman@SU-AIMVAX.ARPA, papa@SU-SCORE.ARPA,
Lindstrom@UTAH-20.ARPA
In-Reply-To: Message from "Yoni Malachi <YM@SU-AI.ARPA>" of Tue 14 May 85 08:08:00-MDT
Yoni,
Thanks for the information. Yes, I would like to give a talk, and meet with
the people interested in logic programming at Stanford. I will append a copy
of the title and abstract here. I'll plan on spending a half-day at
Stanford. Any day would be ok except Wednesday -- perhaps Thursday? But I
leave it to your judgment as to what might be the best time.
I don't think I'll have time to visit Parc or SRI this trip. However, you can
publicize the Stanford talk in those places, if you wish.
Thanks,
--Gary
FUNCTIONAL PROGRAMMING AND THE LOGICAL VARIABLE
Gary Lindstrom
Department of Computer Science
University of Utah
Salt Lake City, Utah 84112
Logic programming offers a variety of computational effects which go beyond
those customarily found in functional programming languages. Among these
effects is the notion of the "logical variable," i.e. a value determined by the
intersection of constraints, rather than by direct binding. We argue that this
concept is "separable" from logic programming, and can sensibly be incorporated
into existing functional languages. Moreover, this extension appears to
significantly widen the range of problems which can efficiently be addressed in
function form, albeit at some loss of conceptual purity. In particular, a form
of side-effects arises under this extension, since a function invocation can
exert constraints on variables shared with other function invocations.
Nevertheless, we demonstrate that determinacy can be retained, even under
parallel execution. The graph reduction language FGL is used for this
demonstration, by being extended to a language FGL+LV permitting formal
parameter expressions, with variables occurring therein bound by unification.
The determinacy argument is based on a novel dataflow-like rendering of
unification. In addition the complete partial order employed in this proof is
unusual in its explicit representation of demand, a necessity given the
"benign" side-effects that arise. An implementation technique is suggested,
suitable for reduction architectures.
-------
∂14-May-85 0956 CLT spelling
clt.spe[ess,clt] contains a list of the words
i accumulated while running spell over my thesis.
If you should happen to look at it and find any
errors please let me know - so I can fix both
my dictionary and the corresponding spelling bugs in the thesis
∂14-May-85 1012 CL.BOYER@UTEXAS-20.ARPA
Received: from UTEXAS-20.ARPA by SU-AI.ARPA with TCP; 14 May 85 10:12:23 PDT
Date: Tue, 14 May 1985 12:06 CDT
From: CL.BOYER@UTEXAS-20.ARPA
To: jmc@su-ai
Subject:
There is a better reference to your "Recursive Programs as
Functions in a First Order Theory" than as a Stanford tech
report, but I don't know why I know that. Can you give me a
better reference?
Is there any sort of citation that I can give for your
role in the invention of timesharing?
Thanks,
Bob
∂14-May-85 1136 YM Lindstrom
To: JMC@SU-AI.ARPA, ullman@SU-AIMVAX.ARPA, papa@SU-SCORE.ARPA
He is a professor at Utah and sent me the following message.
I told him Zohar is not around and that you guys are generally interested in
logic programming.
--Yoni.
∂14-May-85 0743 LINDSTROM@UTAH-20.ARPA visit
Received: from UTAH-20.ARPA by SU-AI.ARPA with TCP; 14 May 85 07:43:02 PDT
Date: Tue 14 May 85 08:42:18-MDT
From: Gary Lindstrom <Lindstrom@UTAH-20.ARPA>
Subject: visit
To: zm@SU-AI.ARPA
cc: ym@SU-AI.ARPA
Zohar and Yoni,
I will be in Palo Alto the week of June 3-7 on a consulting visit. My time
will be tight, but I'd like to squeeze in a visit to the AI lab while I'm
there, to find out more what's going on in logic programming and related
areas.
If interest warrants, I could give a talk. Let me know what your schedules
are for that week.
Regards,
--Gary
-------
∂14-May-85 1223 JMC
Carol Davidson
416 929-9471, Toronto
c/o Quirks and Quarks
CBC
Box 500,
Station A
Toronto Ontario, M5W1E6
∂14-May-85 1420 SMC Bledsoe called just after you left, postponing is fine, but he will
be out of town Mon. to Wed. after that he should be fairly flexible.
Also, I need to get a check for storage , $115.00 this is for the second half
of April and all of May. I moved from a larger cubicle to a small one, so the
rate isn't as high as for April.
∂14-May-85 1807 RA David Chudnovsky
David says thank you. He'll call you tomorrrow.
Also, Prof. Takeo Kanade from CMU called re reference. His off. no.
is (412) 578 3016 and home: (412) 242 6067.
∂14-May-85 2013 RA tickets
The tickets are at the receptionist desk; I was on my way down to pick
them up but got interrupted and then forgot all about it; are you going?
I thought you had to cancel. If you are going, is tomorrow morning
too late to get them?
Sorry about it.
∂15-May-85 1254 ullman@diablo C.R.A.P.
Received: from SU-AIMVAX.ARPA by SU-AI.ARPA with TCP; 15 May 85 12:53:14 PDT
Date: Wed, 15 May 85 10:33:02 pdt
From: Jeff Ullman <ullman@diablo>
Subject: C.R.A.P.
To: cheriton@pescadero, fiegenbaum@sumex, golub@score, jlh@shasta, jmc@sail,
linton@sierra, mayr@diablo, oliger@navajo, owicki@sierra, papa@score,
pratt@navajo, tob@sail
In preparing the white paper, it may be useful to have one, or at most
two, relevant citations from each participant.
Can you send me a suggestion?
Thanks.
∂15-May-85 1306 RA time off
I need to take this afternoon and tomorrow off for personal reasons.
See you Friday.
∂15-May-85 1310 YAO@SU-SCORE.ARPA Lloyd
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 15 May 85 13:09:57 PDT
Date: Wed 15 May 85 12:19:57-PDT
From: Andrew Yao <YAO@SU-SCORE.ARPA>
Subject: Lloyd
To: JMC@SU-AI.ARPA
cc: yao@SU-SCORE.ARPA
John, I received the copy of Lloyd's letter you sent me. If you think
that he is a possible strong candidate, then let us set up a talk for
him when he comes by in July. I will leave it to you to arrange for
his visit. The dates he proposed are all OK with me.
--Andy
-------
∂15-May-85 1348 CLT
please, no supper tonight
∂15-May-85 1429 LES CSD file backup system
To: cheriton@SU-PESCADERO.ARPA
CC: JMC@SU-AI.ARPA
I have some ideas for a system-wide file backup scheme, including the use
of the file computer. Do you or any of your committee members have
preconceived notions in this area, or should I just write up a proposal
for people to shoot at?
∂15-May-85 1623 ARIADNE@SU-SCORE.ARPA tel msg.
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 15 May 85 16:22:52 PDT
Date: Wed 15 May 85 16:08:31-PDT
From: Ariadne Johnson <ARIADNE@SU-SCORE.ARPA>
Subject: tel msg.
To: mccarthy@SU-SCORE.ARPA
Stanford-Phone: (415) 497-0872
pls call Joe Shurkin at the News Service 7-2558.
-------
∂15-May-85 1907 bktotty%mit-teela@mit-athena.ARPA The mysterious message
Received: from MIT-ATHENA.ARPA by SU-AI.ARPA with TCP; 15 May 85 19:07:15 PDT
Received: from mit-teela (mit-teela.ARPA) by mit-athena (4.12/4.7)
id AA06476; Wed, 15 May 85 22:09:15 edt
Received: by mit-teela (4.12/4.7)
id AA13142; Wed, 15 May 85 22:05:47 edt
Date: Wed, 15 May 85 22:05:47 edt
From: bktotty%mit-teela@mit-athena.ARPA (Brian K Totty)
Message-Id: <8505160205.AA13142@mit-teela>
To: jmc@su-ai
Subject: The mysterious message
Cc: djdsouza@nessus
I am a computer science student at M.I.T., planning on working with
artificial intelligence, and I would be very interested if you were the
creator of LISP. I hope I am not making a fool of myself. If you
have a chance, please write back. Sorry for the inconvenience.
Thanks,
Brian Totty
p.s. who is Joe Weening?
∂15-May-85 1915 JJW Random from MIT
Someone from MIT appears to have been trying to send you messages. I saw
several Telnet connections open, and had this conversation with one of the
people:
Is this you again?
sen<BS><BS>
<BS>
Yes. Can you hear (read?) me?
Yes.
Hee<BS>lo<BS><BS><BS><BS>.
I cannot backspace. Sorry about the typos
Excuse me,. but is John McCarthy THE John McCarthy that invented Lisp?
I am enrolled in a Scheme class right now, so I'd be quite amazed if he is.
Pkl<BS>λ
Please Reply.
Yes, JMC is that John McCarthy.
Wow. I am truly quite astounded. I'm not bothering anybody, am I?
Well, if you're sending him messages without good reason, you are.
I am not. I know who is, though, and he is trying to make ammends.
I am merely sitting here, quietly in awe.
I'll leave you alone, now. If you wish to complain to anyone aboutqwwr1sdxsw
(sorry about that()) As I was saying, if you wish to complain about anything I've
done, my address is daalcoce@mit-louiswu (its part of the mit-athena system).
Li,ke I said, the other guy that's been sneding things to John is quite
sorry, and will take care of it somehow.
Bye.
↑C
↑C
.
∂15-May-85 2158 PATTIS@WASHINGTON.ARPA Bruce Franklin & Death
Received: from WASHINGTON.ARPA by SU-AI.ARPA with TCP; 15 May 85 21:58:18 PDT
Date: Wed 15 May 85 21:57:23-PDT
From: Richard Pattis <PATTIS@WASHINGTON.ARPA>
Subject: Bruce Franklin & Death
To: jmc@SU-AI.ARPA
I read about Bruce Franklin for the first time in Alan Dershowitz's book,
"The Best Defense". I don't remember reading anything about a killing. The
book portrayed Franklin as a fairly wild-eyed radical, but Dershowitz was
upset that no one at Stanford rose to defend him at this trial. He implied
that Lyman & Kennedy bullied the professors in the Law School. Could you
explain about the death, or give a pointer?
Rich
-------
∂15-May-85 2257 PATTIS@WASHINGTON.ARPA re: Bruce Franklin & Death
Received: from WASHINGTON.ARPA by SU-AI.ARPA with TCP; 15 May 85 22:57:45 PDT
Date: Wed 15 May 85 22:56:49-PDT
From: Richard Pattis <PATTIS@WASHINGTON.ARPA>
Subject: re: Bruce Franklin & Death
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Wed 15 May 85 22:32:00-PDT
Thanks for the information. As I remember from Dershowitz's book, he was
upset by Franklin's use of Mao & Stalin posters displayed at the defense's
table, so he put up posters of Marx (Groucho) and Lennon (John). At least,
this is what his book said.
I'd like to hear about the fire-bomb tossed into the AI lab. I never heard
of such during my stay at Stanford. When you have time...
Rich
-------
∂15-May-85 2314 cheriton@Pescadero Re: CSD file backup system
Received: from SU-PESCADERO.ARPA by SU-AI.ARPA with TCP; 15 May 85 23:14:38 PDT
Date: Wed, 15 May 85 23:13:54 pdt
From: David Cheriton <cheriton@Pescadero>
Subject: Re: CSD file backup system
To: LES@Sail, cheriton@SU-PESCADERO.ARPA
Cc: JMC@Sail, cheriton@Pescadero
A proposal would be most welcome. I think that file/disk backup is
one of the more important areas to look at in providing a general
service for a collection of machines. I have a few ideas but nothing
very profound. Roughly, ..
There would be a special high-speed network from file servers to
a centrally managed archival service. File servers would reserve
possibly days in advance for the time and amount of transfer they desire,
i.e. each machine would negotiate a backup schedule with the archival
service. The archival service would use disks if necessary to stage
data out to tape or optical disk and for holding tank for requested
data (for restore). Data would be stored as large files with internal
representation at issue for the originating machine. The archival server
would return a special token to the backed up system to confirm safe
storage of the saved data, which would be presented (ideally) on restore
(although one cant have that stand in the way of a restore, of course).
The separate network for backup does sound a little like overkill but
I think the data rates would quickly overwhelm our Ethernets, rendering
the normal Ethernet uses useless during backup periods, which I think will
be unacceptable given the number of workstations that will be used either
directly or for running parallel computations at all hours.
Finally, of course the archival service would provide highly secure data
storage protected from act of god, etc. and would track technology developments
in backup devices, like optical disk.
I was actually thinking of writing up such a proposal for the ACIS group
for a university facility of this nature, although it may be more than
appropriate for us to build a prototype.
Does this bare any resemble to your thoughts?
∂16-May-86 0800 JMC
Greg Nelson,gnelson@decwrl should be asked about applying for industrial lec.
∂16-May-86 0800 JMC
Bookstore charge slips
∂16-May-86 0800 JMC
Carolyn birthday
∂16-May-86 0800 JMC
remind/date=1-jan/time=10 jmc Goguen and Mesguer for Industrial
∂16-May-86 1023 CLT computer
if the computer does not come back soon, i probably won't
won't want to go to supper - unless it is still dead then
so if you want to make other plans feel free
∂16-May-85 1902 MOGUL@SU-SCORE.ARPA Re: "The action may be punitive".
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 16 May 85 19:02:01 PDT
Date: Thu 16 May 85 12:09:35-PDT
From: Jeffrey Mogul <MOGUL@SU-SCORE.ARPA>
Subject: Re: "The action may be punitive".
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Wed 15 May 85 18:41:00-PDT
I have often thought that the "facts" you present are at variance with
what I understand to be true, and I sometimes find your rhetoric bizarre
or illogical. However, your attempt to associate SOSA with the bombings
at Berkeley and SF State is dishonest.
I could ignore the fact, which you have conveniently ignored in recent
weeks, that while SOSA and similar groups at other schools have
preached civil disobedience, they have never suggested that
violence is a tactic they could support. "Non-violent direct
action" is frequently used to describe civil disobedience, and
most organizations require their members to take "non-violence
training" classes before participating in an illegal action.
Your equation of civil disobedience and violence might have been
true a decade ago, and might be true for some fringe groups,
but to impute it to SOSA is without foundation.
What I cannot ignore is your juxtaposition of an admittedly
foolish statement made in support of SOSA's blockade ("The
action may be punitive") with the "Explosion Injures UC
Berkeley Student" story. My recollection of a longer
story, from today's Chronicle, is that someone asked if the
explosion could be related to the UC anti-apartheid actions,
and the answer was that there was no reason to believe so.
I also recall an article on the SF State bombing, and my
impression is that the bomber was a nut, and certainly
there was no mention of South Africa.
Besides, "terrorist bombers" inevitably take credit for their
acts, as they see them as publicity. It makes no sense at
all to suggest that an anti-apartheid group would set off
these bombs, especially if they didn't "take credit". You
are smart enough to realize this, so I am afraid I must question
your motives in posting this article. Perhaps you could clarify
them for me?
-Jeff
P.S.: I think the SOSA blockade is tactically worthless and so
is a bad idea, and I have never supported terrorist bombings.
Whether or not I support SOSA's demands, I think you owe them
an apology.
-------
∂16-May-85 1903 GOLDBERG@SU-CSLI.ARPA
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 16 May 85 19:03:04 PDT
Date: Thu 16 May 85 15:30:02-PDT
From: Jeffrey Goldberg <GOLDBERG@SU-CSLI.ARPA>
To: JMC@SU-AI.ARPA
cc: GOLDBERG@SU-CSLI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Tue 14 May 85 21:44:00-PDT
Isn't 'self righteousness' just righteousness in people we disagree with.
Also, what violence are you talking about? Is breaking a law violence?
Is doing something that bothers someone else violence? If these are
violence, then isn't supporting the government of S.A. violence?
I have no doubt that one can define violence in such a way as to exclude
the trustees and include SOSA, but is it a definition that makes any
sense?
-Jeff Goldberg
-------
∂16-May-85 1918 HANRAHAN@SU-SCORE.ARPA message
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 16 May 85 19:17:53 PDT
Date: Thu 16 May 85 16:01:08-PDT
From: Katherine Hanrahan <HANRAHAN@SU-SCORE.ARPA>
Subject: message
To: mccarthy@SU-SCORE.ARPA
Stanford-Phone: (415) 497-2273
You just had a phone call from Ann Mayo (grad office) 3056. Katie
-------
∂17-May-85 0944 cheriton@Pescadero Multiprocessor project
Received: from SU-PESCADERO.ARPA by SU-AI.ARPA with TCP; 17 May 85 09:40:59 PDT
Date: Fri, 17 May 85 09:41:00 pdt
From: David Cheriton <cheriton@Pescadero>
Subject: Multiprocessor project
To: jmc@su-ai
What's happening with the multiprocessor-Qlambda-Macsyma project of yours?
I think Joe Weening indicated to me a proposal had been written or was
being written.
I am still very interested in having some access to a reasonable
multiprocessor machine if that can be arranged.
∂17-May-85 0948 VAL situation calculus
There seem to be two problems.
1. The axioms for moving and painting in your "Applications" paper are
apparently insufficient for the frame problem unless some kind of uniqueness
of names is assumed. We have to know at least that move(x,l) is different
from paint(x,c).
2. The syntax of situation calculus apparently allows expressions like
result(move(A,location(B,s1)),s0). But what is the meaning of that? If B in
situation s1 is on top of C at the point with coordinates (3,4,5), but in
situation s0 the top of C has coordinates (6,7,8), then where should we move A?
Perhaps, the second argument of move should be not a place, but the *name* of
a place, and only "good" names should be allowed, such as top(C) or (3,4,5), but
not location(B,s1).
∂17-May-85 1024 RA message for Prof. McCarthy
∂16-May-85 1918 HANRAHAN@SU-SCORE.ARPA message for Prof. McCarthy
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 16 May 85 19:18:05 PDT
Date: Thu 16 May 85 16:01:58-PDT
From: Katherine Hanrahan <HANRAHAN@SU-SCORE.ARPA>
Subject: message for Prof. McCarthy
To: ra@SU-AI.ARPA
Stanford-Phone: (415) 497-2273
Please let John know that he had a call from Ann Mayo in the grad office
and her ext. is 3056. Katie
-------
∂17-May-85 1006 VAL Circumscription seminar
To: "@CS.DST[1,VAL]"@SU-AI.ARPA
John McCarthy will be out of town both on 5/22 and 5/29, so part 2 of his talk
on applications to AI is postponed until 6/5.
∂17-May-85 1102 fateman%ucbdali@Berkeley a better parallel machine
Received: from UCB-VAX.ARPA by SU-AI.ARPA with TCP; 17 May 85 10:55:59 PDT
Received: from ucbdali.ARPA by UCB-VAX.ARPA (4.24/4.46)
id AA12996; Fri, 17 May 85 10:53:17 pdt
Received: by ucbdali.ARPA (4.24/4.46)
id AA23175; Fri, 17 May 85 10:55:39 pdt
Date: Fri, 17 May 85 10:55:39 pdt
From: fateman%ucbdali@Berkeley (Richard Fateman)
Message-Id: <8505171755.AA23175@ucbdali.ARPA>
To: clt@su-ai, jmc@su-ai
Subject: a better parallel machine
Cc: les@su-ai
I heard about another machine, not yet announce,d that might be
both suitable and not very expensive. I've heard that both Encore and
Sequent have the disadvantage of being, overall, quite slow compared
to decent serial processors; if we want to demonstrate slow feasibility,
we could do it for even less money.
(company name = Alliant)
How is the contract going?
∂17-May-85 1231 CLT supper
susie called - she and dan will be in the palo alto area
this afternoon and they thought they might go to dinner
with you rather than driving back to SJ.
I told her I thought you might be back around 5ish.
She will try calling you at home, or calling me here
to find out whats up.
∂17-May-85 1406 HEDGES@SU-SCORE.ARPA Peter Will
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 17 May 85 14:06:10 PDT
Date: Fri 17 May 85 13:30:50-PDT
From: Karen Hedges <HEDGES@SU-SCORE.ARPA>
Subject: Peter Will
To: Cannon@SU-SIERRA.ARPA, TOB@SU-AI.ARPA, JMC@SU-AI.ARPA,
Reynolds@SU-SCORE.ARPA, BScott@SU-SCORE.ARPA
Nils has asked me to contact you and let you know that Peter will has
scheduled his visit at Stanford for June 17. He will call though on
May 28 and confirm that date or let us know if he is coming on June 6 & 7
instead.
I will let you know on the 28th his confirmed schedule.
Thanks. --Karen Hedges
-------
∂17-May-85 1412 VAL working schedule
My classes at San Jose State came to an end, and now I can spend all my time
here. But some time in August or September I'd like to take off for a week or
two, if you don't mind (my wife thinks we need vacation).
- vladimir
∂17-May-85 1512 LIBRARY@SU-SCORE.ARPA Socrates conversion of Math/CS Library material
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 17 May 85 15:12:23 PDT
Date: Fri 17 May 85 14:04:22-PDT
From: C.S./Math Library <LIBRARY@SU-SCORE.ARPA>
Subject: Socrates conversion of Math/CS Library material
To: JMC@SU-AI.ARPA
Prof. McCarthy,
As I thought, the cost figures vary greatly. It could be anywhere from
$600,000 to $200,000 or less. The most expensive way would be to basically
go through the regular cataloging procedures and input into RLIN from
which the Socrates database is produced. It is very unlikely that
we would do that. The library is looking into other ways of doing this
and feels that within the next year someone will be capable of doing
retrospective conversions quickly and at less cost then the $600,000.
Harry
-------
∂17-May-85 1518 RA check
I left a check from COMTEX (for royalties) on your terminal.
Have a nice weekend.
∂17-May-85 1653 BETSY@SU-CSLI.ARPA CSLI Project Proposals
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 17 May 85 16:53:30 PDT
Date: Fri 17 May 85 16:52:05-PDT
From: Betsy Macken <BETSY@SU-CSLI.ARPA>
Subject: CSLI Project Proposals
To: Proposals@SU-CSLI.ARPA
cc: John@SU-CSLI.ARPA, Betsy@SU-CSLI.ARPA, Ingrid@SU-CSLI.ARPA
We didn't get your letters about CSLI project proposals out as soon
as we expected, and didn't think about that in relation to the deadlines
we had stated. We are concerned about making these decisions as soon as
possible, but want to be reasonable too. So please get them to us as soon
as you can, but the new deadlines are:
Inform us as to your intention to submit a proposal and
the identity of your group: May 27, 1985
Proposals submitted: June 10, 1985
Proposals reviewed: June 10 -- June 21
Thanks.
Betsy
-------
∂17-May-85 1706 GOLDBERG@SU-CSLI.ARPA Re: reply to message
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 17 May 85 17:05:56 PDT
Date: Fri 17 May 85 17:06:08-PDT
From: Jeffrey Goldberg <GOLDBERG@SU-CSLI.ARPA>
Subject: Re: reply to message
To: JMC@SU-AI.ARPA
cc: GOLDBERG@SU-CSLI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Thu 16 May 85 20:05:00-PDT
Thank you for your thoughtful response. I think that we disagree on merely
two points. First, you say that US companies is S.A. don't support the S.A.
government; I disagree. I doubt that will be able to change each others minds.
You consider the car blockade as provoking violence (but not a violent act
in and of itself?). You cite flamers who said things like 'run 'em over' and
so on. I think that the protesters have a higher opinion of the trustees than
I do of the flamers. I think that the intent was to get arrested. Not to
provoke violence, which is primarily done by violence or by a threat of
violence.
I dislike secondary boycotts. One person's boycott is another's blacklist.
I do not see refusing to invest in (support) a company that supports the
government of S.A.. The question is about the public policy of a company,
not the politics of its employees or customers. I boycotted Coors because I
disliked its labor policies, not because of my objections the political
activities of the Coors brothers. Although, I vehemently dislike the politics
of Anita Bryant, I would not boycott the orange juice company that employed
her. But that company was not investing in her politics. Basically, I do not
think that it is immoral to hire someone Bryant's politics; I do think that
it is immoral to do business with S.A.. Maybe the difference is quantitative
only, or maybe there is a qualitative difference, but I do see any company that
is doing business with S.A. as acting immorally. Thus, boycotting those
companies is a direct boycott, and refusal to invest in them is appropriate.
I trust that you will agree with the logic of my argument, but I'm sure that
you disagree with a number of the premises.
Sincerely,
Jeff Goldberg
-------
∂17-May-85 1709 MOGUL@SU-SCORE.ARPA re: "The action may be punitive".
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 17 May 85 17:09:01 PDT
Date: Fri 17 May 85 15:58:32-PDT
From: Jeffrey Mogul <MOGUL@SU-SCORE.ARPA>
Subject: re: "The action may be punitive".
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Thu 16 May 85 19:55:00-PDT
My feeling is that both the government and the activist left (as
opposed to the fanatical left, for which I have little respect)
learned some useful lessons from the violence of the 1960s.
The government (meaning US, state, local, and campus) learned that
it could avoid violence by avoiding confrontation. There are obviously
times when protesters start the violence, but there are also obviously
times when police start it, and it doesn't necessarily pay to use
"preemptive" strikes to maintain control.
The left learned that violence was something to be avoided, and
something about how to avoid it. Many incidents of violence start
either because a crowd gets out of control, or because a few
provacateurs set things off. I could make some snide remarks
about CoIntelPro, but I don't have any references with me.
At any rate, essentially all of the protests (legal, by the way)
that I have participated in during the last decade have been
carefully organized to avoid violence. "Marshalls" are usually
designated for crowd control, and to spot and defuse provocateurs.
The April 20 march in SF (50,000 people) went very smoothly,
and the marshalls were quite obviously present. The violent
"protest" a few weeks later, by some nihilistic punks, is an
aberration; I doubt they had any intentions of avoiding violence.
Organizers are probably also more sophisticated about the fanatical
groups (Maoists, Sparticists, USLP=FEP=NCLC, etc.) than they
were in the past; I see these people much less often than in
the early 70s.
Of course there is going to be nostalgia for the 60s. Most of
the left believes that the country has been moving to the right
and that this is a dangerous and unfortunate trend. You would
no doubt disagree, but given the basic anti-Reaganism orientation
of SOSA members, one cannot expect them to be happy with the apathy
of the 70s. You and I should both hope that they avoid the
pitfalls of the 1960s, unless you would rather see the left
self-destruct in a blaze of violence than non-violently bring
about fundamental change.
-Jeff
-------
∂18-May-85 1257 CLT
i have been driven out of my office by gardners again
there are 4 of them buzzing away and have been off and on
since 10 am. I can't stand it
hopefully they will go away by 5 and i can work again
but i guess i won't want to take time for supper then since
i can't work this afternoon
sorry but i am about to give up on this place
∂18-May-85 2100 LES
∂17-May-85 2208 JMC
It would seem we could start Vladimir's full time appointment soon.
∂17-May-85 1412 VAL working schedule
My classes at San Jose State came to an end, and now I can spend all my time
here. But some time in August or September I'd like to take off for a week or
two, if you don't mind (my wife thinks we need vacation).
- vladimir
---------------
He is currently slated to be full time beginning June 1. If approved, he
will then also begin receiving the higher rate of pay that I suggested.
Either of these changes could be accelerated if appropriate.
∂20-May-85 0836 LINDSTROM@UTAH-20.ARPA visit
Received: from UTAH-20.ARPA by SU-AI.ARPA with TCP; 20 May 85 08:36:29 PDT
Date: Mon 20 May 85 09:35:30-MDT
From: Gary Lindstrom <Lindstrom@UTAH-20.ARPA>
Subject: visit
To: jmc@SU-AI.ARPA
cc: ym@SU-AI.ARPA, Lindstrom@UTAH-20.ARPA
John,
I will be visiting Stanford on Thursday, June 6, and giving a colloquium at
11am. If you can spare the time, I would enjoy spending a half hour or so
that morning talking about logic programming and related topics.
--Gary Lindstrom
-------
∂20-May-85 0948 RA VTSS
Virginia Mann 7-2565 called re course of VTSS. She'll be back in her office
after 1:30pm.
∂20-May-85 1141 LES Qlisp
To: Squires@USC-ISI.ARPA
CC: JMC@SU-AI.ARPA
Steve:
Our formal proposal allegedly escaped from the Sponsored Projects Office here
a couple of weeks ago and was dispatched there. I trust that it arrived
safely and is under scrutiny.
We realize that the starting date in the budget (June 1) is quite
unrealistic now. It didn't get changed after the January draft.
If you decide to fund the Qlisp work, one mechanism that might speed the
process would be to make it an addendum to the existing blanket Navelex
contract here (N00039-84-C-0211). Alternatively, it could be added to
the older Basic AI Research contract (N00039-82-C-0250).
If there is anything that we can do to speed the process, please let us know.
Regards,
Les Earnest
∂20-May-85 1313 CL.BOYER@UTEXAS-20.ARPA review
Received: from UTEXAS-20.ARPA by SU-AI.ARPA with TCP; 20 May 85 13:13:29 PDT
Date: Mon, 20 May 1985 15:12 CDT
From: CL.BOYER@UTEXAS-20.ARPA
To: jmc@su-ai
Subject: review
I have been asked by Dantzig to write a review of your
scientific work. If you have the time, I would appreciate
your comments on the material that follows. I would
appreciate not only corrections, but also suggestions for
expansion.
John McCarthy, Professor of Computer Science at Stanford, has arguably
contributed more to Computer Science than anyone else alive. His contributions
are only exceeded by those of John von Neumann and Alan Turing. His major
contributions are to programming languages, artificial intelligence, the theory
of computation, and time-sharing.
PROGRAMMING LANGUAGES
The second oldest programming language still in use is Lisp. It is the main
programming language used in artificial intelligence and in symbolic
computation. The invention of Lisp is primarily the work of John
McCarthy [4, 10, 14]. Here are some of the important features of Lisp, all of
which appeared first in Lisp.
1. Dynamic storage allocation. The CONS operator, when given two
arguments, returns an ordered pair. The details of the storage
allocation necessary to construct the pair is completely hidden from
the programmer. When the programmer no longer maintains reference
to the pair, the allocated storage is automatically reclaimed, or
garbage collected. Dynamic storage allocation reduces the
intellectual burden of programming and yields dramatic increases
both in the programmer's productivity and the intelligibility of his
work.
2. The IF expression. In Lisp, the term (IF a b c) returns c if a is
NIL and otherwise returns b. (The earlier IF statement that
occurred in the Fortran programming language does not return a value
but instead transfers control.)
3. Procedures and functions as values. In prior programming languages
such as Algol, functions could not be returned as values because the
environment that specified the values of free variables occurring in
the function could not be captured. In Lisp, the FUNCTION construct
achieves this effect.
4. Expressions as objects. In the more common programming languages,
e.g. Fortran, the kinds of objects that are found, such as integers
or arrays, do not include programs. Lisp, like assembly language,
arranges for programs also to be manipulable objects. For example,
the expression:
(DEFUN FACT (N) (IF (EQUAL N 0) 1 (* N (FACT (- N 1)))))
is not only the defining form for the factorial function, acceptable
to the Lisp compiler, but it is also a Lisp list whose second
element is the word "FACT". This is perhaps the main reasons that
Lisp was the first language (and still one of the few) to have an
extensive programming environment. Examples of utilities found in
virtually all Lisp systems since 1970 are symbolic debugging,
structure editing, read macros, stepping, advising, tracing, and
interactive interrupt handling.
5. Programming language as logic. Lisp has an important subset known
as Pure Lisp which is not only a programming language but is also a
logical language. That is, programs in Pure Lisp may be properly
viewed as logical, mathematical characterizations of the desired
program. Pure Lisp preceded by a decade the development of other
"logic programming" languages, such as the Prolog language adopted
by the Japanese Fifth Generation computer project. Lisp was the
first language in which one could state and prove theorems about
programs, and no language designed since has been as easy to reason
about. This topic is further explored under the heading "theory of
computation."
Although from a very theoretical point of view all programming languages are
equally powerful, it is an undeniable practical fact that Lisp greatly sped up
the development of artificial intelligence. In retrospect it is difficult even
to imagine the development of expert symbolic manipulation systems such as
Macsyma (whose abilities at such activities as symbolic integration are
unsurpassed save by a handful of humans) without the prior invention of LISP.
McCarthy served on the committee of 13 that defined the Algol programming
language [16]. Algol has had wide influence through such descendants as the
languages Pascal and Ada.
**It was through his influence that Algol 60 and its successors include
conditional expressions and recursive programs.
Largely for his contributions to programming languages, McCarthy received the
Turing award in 1971. The Turing award, given annually by the Association for
Computing Machinery, is generally recognized as the highest award in computing.
Other members of the U. S. National Academy who have received the award are
Marvin Minsky and Don Knuth. In addition, Turing award recipient C.A.R. Hoare
is a Fellow of the British Royal Society and recipient E.W. Dijkstra is a
member of the Netherlands Royal Academy of Arts and Sciences.
With R. Gabriel, McCarthy is currently leading the way to answering the
question how best to utilize multiple computer processors to execute higher
level languages such as Lisp in parallel [2].
ARTIFICIAL INTELLIGENCE
McCarthy's pivotal influence on artificial intelligence is indicated by the
fact that he invented the term "artificial intelligence." His work in the
field began in 1949. He was director of the Stanford Artificial Intelligence
Laboratory from 1965 to 1980. That laboratory has set the direction in
artificial intelligence research in a way only comparable to the two other
major artificial intelligence projects, at MIT and CMU. McCarthy was president
of the American Association for Artificial Intelligence in 1983-4. Besides
organizing and shaping the field, McCarthy has made numerous, specific,
important, contributions to AI. For example,
1. He wrote several of the earliest theorem-proving programs. See for
example the Wang algorithm program in [10] and the paper [6].
2. He was the first in computing to espouse the use of logic as a basis
for representing the world within a computer [3, 11]. He was the
first to study and to establish the importance of "common sense"
reasoning, knowledge representation, the "frame problem," and the
use of modal logics in artificial intelligence [4, 12].
3. He still is the leader in the active field of common sense
reasoning. His paper [13] introduced the concept of
"circumscription" which provides artificial intelligence with a
rigorous foundation for the philosophical notion of inductive proof.
More recent work on circumscription includes [15].
THEORY OF COMPUTATION
McCarthy founded the theory of computation. His early seminal
articles [5, 7, 9] introduced the idea of reasoning about computer programs
from a mathematical point of view. He provided an axiomatization and rules of
inference for a theory of recursive functions that was simultaneously the
programming language Pure Lisp. He presented numerous proofs within this
formalism, including proofs involving termination and the value "undefined"
(standing for the value of a nonterminating computation). He described a
method for transforming programs written in conventional languages such as
Fortran to expressions in his logic. In [1] McCarthy and Cartwright provide a
semantics for recursive function theory that is an attractive alternative to
the rather esoteric continuous domain work of Dana Scott.
TIMESHARING
McCarthy invented the idea of timesharing in 1959 [8]. Almost all computers
today use timesharing, even microprocessors. The idea of timesharing is that
by arranging for a clock to interrupt a computer frequently, say every 60th of
a second, so that the computer will switch from one task to another, it is
possible to make one processor appear to do the work of many (perhaps 100)
similar processors, albeit running at a somewhat slower rate.
REFERENCES
1. R. Cartwright and J. McCarthy. Recursive Programs as Functions in a First
Order Theory. STAN-CS-79-717, Computer Science Department, Stanford
University, 1979.
2. R. Gabriel, J. McCarthy. Queue-based Multi-processing Lisp. Conference
Record of the 1984 ACM Symposium on Lisp and Functional Programming, 1984, pp.
25-43.
3. J. McCarthy. Programs with Common Sense. Proceedings of the Teddington
Conference on the Mechanization of Thought Processes, 1959.
4. J. McCarthy. The Lisp Programmer's Manual. M.I.T. Computation Center,
1960.
5. J. McCarthy. "Recursive Functions of Symbolics Expressions and their
Computation by Machine". Communications of the Association for Computing
Machinery 3, 4 (1960), 184-195.
6. J. McCarthy. Computer Programs for Checking Mathematical Proofs.
Recursive Function Theory, Proceedings of a Symposium in Pure Mathematics,
Providence, Rhode Island, 1962, pp. 219-227.
7. J. McCarthy. Towards a Mathematical Science of Computation. Proceedings
of IFIP Congress, 1962, pp. 21-28.
8. J. McCarthy. Time-Sharing Computing System. In Management and the
Computer of the Future, M. Greenberger, Ed., The MIT Press, 1962.
9. J. McCarthy. A Basis for a Mathematical Theory of Computation. In
Computer Programming and Formal Systems, P. Braffort and D. Hershberg, Eds.,
North-Holland Publishing Company, Amsterdam, The Netherlands, 1963.
10. J. McCarthy, et al.. LISP 1.5 Programmer's Manual. The MIT Press,
Cambridge, Massachusetts, 1965.
11. J. McCarthy. Programs with Common Sense. In Semantic Information
Processing, M. Minsky, Ed., The MIT Press, 1968, pp. 403-418.
12. J. McCarthy and P. Hayes. Some Philosophical Problems from the Standpoint
of Artificial Intelligence. Machine Intelligence 4, 1969, pp. 463-502.
13. John McCarthy. Epistemological Problems of Artificial Intelligence.
Proceedings of the 5th Joint Conference on Artificial Intelligence, 1977.
14. J. McCarthy. "History of LISP". ACM SIGPLAN Notices 13, 8 (1978).
15. J. McCarthy. "Circumscription - A Form of Non-Monotonic Reasoning".
Artificial Intelligence 13, 1 (1980).
16. P. Naur, et al. "Revised Report on the Algorithmic Language ALGOL 60".
Communications of the Association for Computing Machinery 6, 1 (1963), 1-20.
∂20-May-85 1400 RA AAAS
Did you find out where the AAAS is going to be so I can take care of
a hotel reservation?
∂20-May-85 1422 GENESERETH@SUMEX-AIM.ARPA qual schedule
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 20 May 85 14:22:28 PDT
Date: Mon 20 May 85 14:21:25-PDT
From: Michael Genesereth <GENESERETH@SUMEX-AIM.ARPA>
Subject: qual schedule
To: TOB@SU-AI.ARPA, Buchanan@SUMEX-AIM.ARPA, Feigenbaum@SUMEX-AIM.ARPA,
JMC@SU-AI.ARPA, Nilsson@SU-SCORE.ARPA, Rosenbloom@SUMEX-AIM.ARPA,
tw@SU-AI.ARPA
Gentlemen,
I have received multiple requests to move the qual into finals week.
In response to these requests I checked with all four of the people
currently signed up for the qual, and they agreed that finals week
would be okay. Now I need to find out whether you all can make it
that week, preferably on Thursday the 13th or Friday the 14th.
mrg
-------
∂20-May-85 1439 RA Bert Raphael
Bert called, re: personal, (415) 857 5648
∂20-May-85 1503 RA symbolics
Dan Salas from Symbolics (415) 494 8081 called. He is a new peron
with Symbolics and wanted to introduce himself.
∂20-May-85 1506 FEIGENBAUM@SUMEX-AIM.ARPA Re: qual schedule
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 20 May 85 15:06:20 PDT
Date: Mon 20 May 85 15:05:32-PDT
From: Edward Feigenbaum <FEIGENBAUM@SUMEX-AIM.ARPA>
Subject: Re: qual schedule
To: GENESERETH@SUMEX-AIM.ARPA, TOB@SU-AI.ARPA, Buchanan@SUMEX-AIM.ARPA,
JMC@SU-AI.ARPA, Nilsson@SU-SCORE.ARPA, Rosenbloom@SUMEX-AIM.ARPA,
tw@SU-AI.ARPA
In-Reply-To: Message from "Michael Genesereth <GENESERETH@SUMEX-AIM.ARPA>" of Mon 20 May 85 14:21:30-PDT
Yes, Mike, either 13trh or 14th is OK....Ed
-------
∂20-May-85 1538 EC.CAT@Lindy Please send Socrates Update to
Received: from SU-LINDY.ARPA by SU-AI.ARPA with TCP; 20 May 85 15:38:26 PDT
Date: Mon, 20 May 85 15:38:17 PDT
From: SOCRATES Pgm <EC.CAT@Forsythe>
To: JMC@SU-AI
Subject: Please send Socrates Update to
REPLY TO 05/17/85 22:31 FROM JMC@SU-AI.ARPA "John McCarthy": Please send
Socrates Update to
Your name will be added to the mailing list for Socrates
Update as you requested. You should be receiving the third
issue sometime in the upcoming week.
To: JMC@SU-AI.ARPA
∂20-May-85 1635 NILSSON@SU-SCORE.ARPA Re: qual schedule
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 20 May 85 16:34:58 PDT
Date: Mon 20 May 85 16:30:33-PDT
From: Nils Nilsson <NILSSON@SU-SCORE.ARPA>
Subject: Re: qual schedule
To: GENESERETH@SUMEX-AIM.ARPA
cc: TOB@SU-AI.ARPA, Buchanan@SUMEX-AIM.ARPA, Feigenbaum@SUMEX-AIM.ARPA,
JMC@SU-AI.ARPA, Rosenbloom@SUMEX-AIM.ARPA, tw@SU-AI.ARPA,
NILSSON@SU-SCORE.ARPA
In-Reply-To: Message from "Michael Genesereth <GENESERETH@SUMEX-AIM.ARPA>" of Mon 20 May 85 14:23:08-PDT
June 13 is fine for me all day. June 14 is fine in the am only. -Nils
-------
∂20-May-85 1720 FEIGENBAUM@SUMEX-AIM.ARPA NASA workshop in September
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 20 May 85 17:20:16 PDT
Date: Mon 20 May 85 17:18:53-PDT
From: Edward Feigenbaum <FEIGENBAUM@SUMEX-AIM.ARPA>
Subject: NASA workshop in September
To: ksl-exec@SUMEX-AIM.ARPA, levinthal@SU-SIERRA.ARPA, nii@SUMEX-AIM.ARPA,
brown@SUMEX-AIM.ARPA, nilsson@SU-SCORE.ARPA, jmc@SU-AI.ARPA
I had a visit from a Louis P. Clark, OR guy from Office of the Chief Engineer
at NASA. He told me of a NASA workshop on "Automation and AI for the Space
Station", to be held Sept. 4-6 in Washington. It is jointly sponsored by
the American Instittue of Aeronautics and Astronautics. ARPA is apparently
warmly supportive. There will be invited papers only.
The first morning will include remarks by the NASA Administrator, by
congressmen, and by Bob Cooper of DARPA. Plus talks on:
a. NASA requirements for the space station
b. The DARPA experience at managing large AI efforts (by Buffalano)
Next will be a talk outlining what NASA's recent report on automation
for the space station (by Dave Criswell of the California Space Institute)
And panels.
And some papers on developments in expert systems
And...
[and they want to let congress know how expensive this kind of automation
R & D can be, he said]
Anyone interested? I am not particularly interested. Space station work is
intrinsically interesting but dealing with NASA is not. However, I have to
be in New York for a meeting on the morning of Sept. 5, so I might attend
on the afternoon of the 5th or on the previous day.
Clark's phone, if you want to get involved, is 202-453-2158
Ed
-------
∂21-May-85 0900 JMC
Phyllis Wickman, omega, 800 828-2323
∂21-May-85 0900 JMC
non-mon for aaas and travel
∂21-May-85 0926 RA presentation by Flexible Computer Corp.
To: JMC, LES
Ray Caron from Flexible Computer Corp. called to invite you to
a presentation their product Flex 32 which will be given at Stanford tomorrow at
11:00am. The coordinator is Steve Lundstrom 7-0140. Caron's tel: (415) 593 7044.
∂21-May-85 1033 CLT dumps a SAIL
To: bosack@SU-SCORE.ARPA
CC: JMC@SU-AI.ARPA
I have just discovered (the hard way of course)
that no dumps have been done at SAIL for over a week,
not even t-dumps. I can live without pumpkin
but I think it is unacceptable for a computer facility
not to provide backup service.
∂21-May-85 1039 RA David Chudnovsky
Please call David at home (212) 864 5320
∂21-May-85 1032 VAL frame problem
One more difficulty with your axioms for the frame problem: circ'n may not give
the desired effect because abnormalities of different situations may conflict
with each other. Imagine that in situation s0 we have a few blocks on the table,
and then we built a tower. In the resulting situation there are many abnormalities:
only the block at the top of the tower can be moved. But if we assume that nothing
can be moved in s0 and in the final situation all blocks are still on the table,
then we have fewer abnormalities in the final situation. (Intuitively, the blocks
are "hot" in s0 and we can't move them until they "cool down"). This is not the
values of the ab's that we have in mind, but they are minimal and thus cannot
be eliminated using circumscription.
A possible solution is to make "result" a partial function, so that
result(move(A, top A), s0) will be simply undefined. Then there will be
apparently no conflict between abnormalities in different situations. If
we want to do that but don't want to have partial functions in the language
then we may introduce predicate possible(s) and axioms like
- possible(result(move(x, top x),s)),
possible(result(e,s)) -> possible(s).
How do you feel about it?
∂21-May-85 1127 RA trips
Your ticket for tomorrow is on your desk.
May 28 trip:
PSA 206, depart 9:25, arrive 10:29.
You have a reservation at the LA Hilton. They gave you a special rate of
$67.00 + 10%.
LA to SJ, PSA 231 7:00pm, arrive 7:57.
June 5th to Austin:
SJ to Austin, Muse 862 6:55 arrive 12:50.
June 8, Austin to SJ Muse 863 9:20 to LA, arrive LA 10:15; Air Cal
533 LA to SJ, depart 11:00, arrive 12:00.
If you would like to change anything, let me know and I'll call Frank
at Dina Bolla.
∂21-May-85 1229 RA [Reply to message recvd: 20 May 85 20:53 Pacific Time]
I replaced your old phone book with the new one.
∂21-May-85 1408 SQUIRES@USC-ISI.ARPA Re: Qlisp
Received: from USC-ISI.ARPA by SU-AI.ARPA with TCP; 21 May 85 14:07:52 PDT
Date: 21 May 1985 17:05-EDT
Sender: SQUIRES@USC-ISI.ARPA
Subject: Re: Qlisp
From: Stephen L. Squires <SQUIRES@USC-ISI.ARPA>
To: LES@SU-AI.ARPA
Cc: Squires@USC-ISI.ARPA, JMC@SU-AI.ARPA
Message-ID: <[USC-ISI.ARPA]21-May-85 17:05:28.SQUIRES>
In-Reply-To: The message of 20 May 85 1141 PDT from Les Earnest <LES@SU-AI.ARPA>
Proposal received. We are working the start up problem. At worst we should
be in a good position for a prompt FY86 start.
∂21-May-85 1627 RA united parcel service
The package from Random House was already sent back. I will call Lynn
Scarlett to ask her to see to it that another one is sent to you.
∂21-May-85 2123 yorick%nmsu.csnet@csnet-relay.arpa
Received: from CSNET-RELAY.ARPA by SU-AI.ARPA with TCP; 21 May 85 21:23:20 PDT
Received: from nmsu by csnet-relay.csnet id ah24311; 21 May 85 22:49 EDT
Received: by nmsu.csnet (4.12/)
id AA17221; Tue, 21 May 85 15:41:01 mdt
Date: Tue, 21 May 85 15:41:01 mdt
From: Yorick Wilks <yorick%nmsu.csnet@csnet-relay.arpa>
To: jmc@su-ai.ARPA
I am rudely getting into the correspondence youre having with
Derek Partridge, on the ground I suggested your name to him because JMC
suggested it to me---presumably on the ground that you wouldnt be the kind
of AI person who would talk horseshit at a conference on this stuff. So
you see, you can help keep the HS le vel down, by coming.
As to philosophers we have Boden, Dreyfus, Dennett (we hope), and
Churchland--plus Fodor, Pylyshyn and Needham who are semi or would-be
philosphers, at least at intervals.
You arent being asked for a paper---I think the invite is pretty clear on
this---just a position statement. My own view on this (DP and others may
differ) is that your TMS stuff is interesting and if you thought it worth
while to steer that in the general direction of the issues of the meeting,
why that would be great.I am sure you can see why we didnt just want a
bunch of AI people talking about their systems, though----but JMC must
have thought your stuff could be put in a form so as to be of interest to
people discussing general issues about methodology. Do you?
Yorick Wilks.
Cc: Derek Partridge, John McCarthy.
∂21-May-85 2124 yorick%nmsu.csnet@csnet-relay.arpa
Received: from CSNET-RELAY.ARPA by SU-AI.ARPA with TCP; 21 May 85 21:23:39 PDT
Received: from nmsu by csnet-relay.csnet id ai24311; 21 May 85 22:49 EDT
Received: by nmsu.csnet (4.12/)
id AA17236; Tue, 21 May 85 15:42:51 mdt
Date: Tue, 21 May 85 15:42:51 mdt
From: Yorick Wilks <yorick%nmsu.csnet@csnet-relay.arpa>
To: jmc@su-ai.ARPA
John,
I left header off last message. It is to deKleer.`λ
Yorick
∂22-May-85 0933 RA Wants to meet with you
Oswald Wiener, from Germany, he is writing about AI in Europe, would
like to meet with you for a few minutes Friday. I told him to call you
Friday morning. His tel. (55) 861 8791
∂22-May-85 0939 SJG number theory
Now that there are all of these connections to factorization and therefore
to encryption, I have the following question: Clearly number theory is no
longer the useless pursuit it used to be. Is this because a valid application
has in fact been found, or merely because the US government, in some sense,
has "declared" it to be useful?
∂22-May-85 0954 RA Cuthbert Hurd
Hurd called, wanted to take you out for lunch.
∂22-May-85 1003 VAL re: frame problem
[In reply to message rcvd 21-May-85 15:00-PT.]
The problem with the idea of giving normality in s higher priority than
normality in result(e,s) is that we don't really have here two different
kinds of abnormality (or abnormality of two different aspects), but rather
two different choices of the first argument of the same aspect. Thus it
would require a further generalization of priorities, which, in particular,
would allow infinitely many priorities:
s > result(e,s) > result(e1,result(e,s)) > ...
and it seems to me that we should avoid that complication if possible.
Maybe your idea of "abb" will help reduce it to just two levels of priorities?
∂22-May-85 1054 DOYLE@CMU-CS-C.ARPA recommendation
Received: from CMU-CS-C.ARPA by SU-AI.ARPA with TCP; 22 May 85 10:54:50 PDT
Received: ID <DOYLE@CMU-CS-C.ARPA>; Wed 22 May 85 13:54:42-EDT
Date: Wed 22 May 85 13:54:38-EDT
From: Jon.Doyle@CMU-CS-C.ARPA
Subject: recommendation
To: jmc@SU-AI.ARPA
Dear John,
I know you are very busy, but would you be willing to write a
letter of recommendation for me? I am looking into a position
at Rice University, and would be very grateful if you could
help me with this.
I hope you are doing well. I enjoyed visiting with Jeff Rosenschein
and Matt Ginsberg when they visited CMU. They seemed to be doing
very nice work. I hope Ben Grosof can stop by some time.
I will look for you at IJCAI.
Thanks very much,
Jon
-------
∂22-May-85 1407 ASHOK@SU-SUSHI.ARPA [Andrew Yao <YAO@SU-SCORE.ARPA>: interview candidate]
Received: from SU-SUSHI.ARPA by SU-AI.ARPA with TCP; 22 May 85 14:06:49 PDT
Date: Wed 22 May 85 14:06:28-PDT
From: Ashok Subramanian <ashok@SU-SUSHI.ARPA>
Subject: [Andrew Yao <YAO@SU-SCORE.ARPA>: interview candidate]
To: jmc@SU-AI.ARPA
Return-Path: <YAO@SU-SCORE.ARPA>
Received: from SU-SCORE.ARPA by SU-SUSHI.ARPA with TCP; Wed 22 May 85 13:43:39-PDT
Date: Wed 22 May 85 13:41:37-PDT
From: Andrew Yao <YAO@SU-SCORE.ARPA>
Subject: interview candidate
To: papa@SU-SCORE.ARPA, mjc@SU-AI.ARPA, ashok@SU-SCORE.ARPA
cc: nilsson@SU-SCORE.ARPA, yao@SU-SCORE.ARPA
In our last meeting of the search committee, one of the dozen or so candidates
remaining on the list is Umesh Vazirani. I would be interested in having
him come down in the near future to give a talk, and meet with students, etc.
Would you be in favor of this? I think it would be good if we get to see
all these candidates when we have a chance, instead of trying to squeeze
them into a few weeks in the future. Also, Umesh is going away for one or
two months after the beginning of June. So if we want to have him come
down in the near future, we have to do it in a week or ten days.
Thanks.
--Andy
-------
-------
∂22-May-85 1615 PIERCE@SU-SCORE.ARPA Secretarial Assistance
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 22 May 85 16:15:30 PDT
Date: Wed 22 May 85 16:15:31-PDT
From: Lee Pierce <PIERCE@SU-SCORE.ARPA>
Subject: Secretarial Assistance
To: jmc@SU-AI.ARPA
John,
Just to let you know we are aware that you may need secretarial assistance
in Rutie's absence. I am working on having someone available for you.
If you need help before I get back to you, please let me know and I will
get you assistance.
Lee
-------
∂22-May-85 1945 CLT
i have gone to naomi sparrow's piano recital
i can walk or drive when i get ready to come home
so you don't need to wait up
∂22-May-85 2105 ASHOK@SU-SUSHI.ARPA [C. Papadimitriou <PAPA@SU-SCORE.ARPA>: Re: interview candidate]
Received: from SU-SUSHI.ARPA by SU-AI.ARPA with TCP; 22 May 85 21:05:12 PDT
Date: Wed 22 May 85 21:05:00-PDT
From: Ashok Subramanian <ashok@SU-SUSHI.ARPA>
Subject: [C. Papadimitriou <PAPA@SU-SCORE.ARPA>: Re: interview candidate]
To: jmc@SU-AI.ARPA
Return-Path: <PAPA@SU-SCORE.ARPA>
Received: from SU-SCORE.ARPA by SU-SUSHI.ARPA with TCP; Wed 22 May 85 20:34:26-PDT
Date: Wed 22 May 85 20:28:46-PDT
From: C. Papadimitriou <PAPA@SU-SCORE.ARPA>
Subject: Re: interview candidate
To: ashok@SU-SUSHI.ARPA
cc: YAO@SU-SCORE.ARPA, mjc@SU-AI.ARPA, nilsson@SU-SCORE.ARPA
In-Reply-To: Message from "Ashok Subramanian <ashok@SU-SUSHI.ARPA>" of Wed 22 May 85 14:11:08-PDT
I also think it is time to invite Umesh.
Christos.
-------
-------
∂22-May-85 2108 ASHOK@SU-SUSHI.ARPA Re: interview candidate
Received: from SU-SUSHI.ARPA by SU-AI.ARPA with TCP; 22 May 85 21:08:26 PDT
Date: Wed 22 May 85 21:08:00-PDT
From: Ashok Subramanian <ashok@SU-SUSHI.ARPA>
Subject: Re: interview candidate
To: PAPA@SU-SCORE.ARPA
cc: YAO@SU-SCORE.ARPA, jmc@SU-AI.ARPA, nilsson@SU-SCORE.ARPA
In-Reply-To: Message from "C. Papadimitriou <PAPA@SU-SCORE.ARPA>" of Wed 22 May 85 20:34:40-PDT
Let me point out that the original message was sent to mjc@sail instead of
jmc@sail. So doing a "reply all" means that poor Mike Clancy gets more mail,
and John McCarthy doesn't.
ashok
-------
∂22-May-85 2137 JJW Summer plans
I've arranged to visit IDA in Princeton from June 24 to July 26. After
that, as I mentioned before, I'd like to arrange some kind of part-time
support for the rest of the summer.
Lucid has offered me part-time work on their compiler. It would teach me
about the internals of Lisp, but I'm somewhat afraid that it will distract
me too much. You said a while back that you might be able to support me.
Can this still be arranged?
I'm a bit overdue on my reply to Lucid, so I'd like to know fairly soon.
∂22-May-85 2146 ASHOK@SU-SUSHI.ARPA re: interview candidate
Received: from SU-SUSHI.ARPA by SU-AI.ARPA with TCP; 22 May 85 21:46:10 PDT
Date: Wed 22 May 85 21:45:57-PDT
From: Ashok Subramanian <ashok@SU-SUSHI.ARPA>
Subject: re: interview candidate
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Wed 22 May 85 21:23:00-PDT
Yes, but does he want it ?
ashok
-------
∂23-May-85 0754 DOYLE@CMU-CS-C.ARPA re: recommendation
Received: from CMU-CS-C.ARPA by SU-AI.ARPA with TCP; 23 May 85 07:54:16 PDT
Received: ID <DOYLE@CMU-CS-C.ARPA>; Thu 23 May 85 10:54:12-EDT
Date: Thu 23 May 85 10:54:09-EDT
From: Jon.Doyle@CMU-CS-C.ARPA
Subject: re: recommendation
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Wed 22 May 85 21:06:00-EDT
John,
Thank you very much for your help. I believe Rice will send you a
request.
Thanks again,
Jon
-------
∂23-May-85 0801 JK ekl
Glb has gotten all the proofs involving finite functions, permutations
and the pigeon hole principle in fairly good shape.
We would like to publish it as a tech report --- I have asked him to
talk to you about this.
Our plans for summer include getting GLB started on hacking and
implementing some of the ideas I had last fall.
∂23-May-85 1000 JMC
letters: Lloyd, Chinese, applicants
∂23-May-85 1023 PIERCE@SU-SCORE.ARPA Secretarial Assistance
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 23 May 85 10:22:51 PDT
Date: Thu 23 May 85 10:09:01-PDT
From: Lee Pierce <PIERCE@SU-SCORE.ARPA>
Subject: Secretarial Assistance
To: jmc@SU-AI.ARPA
John,
Anne Richardson will be available to provide any secretarial assistance
you need while Rutie is on vacation. Anne is Gene Golub's secretary
and she said she will be happy to help since Gene is out of town.
She is Richardson@score. She will be on vacation tomorrow, May 24,
however. If you need help tomorrow, let me know and I'll find someone
for you.
Lee
-------
∂23-May-85 1116 avg@diablo re: International Debate (from SAIL's BBOARD)
Received: from SU-AIMVAX.ARPA by SU-AI.ARPA with TCP; 23 May 85 11:16:42 PDT
Date: Thu, 23 May 85 11:16:27 pdt
From: Allen VanGelder <avg@diablo>
Subject: re: International Debate (from SAIL's BBOARD)
To: JMC@Sail, su-bboards@diablo
Maybe they flip a coin to choose which goal they will defend just
before the debate starts.
∂23-May-85 1132 BSCOTT@SU-SCORE.ARPA Qlisp . . . Proposal to ARPA
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 23 May 85 11:32:07 PDT
Date: Thu 23 May 85 11:32:06-PDT
From: Betty Scott <BSCOTT@SU-SCORE.ARPA>
Subject: Qlisp . . . Proposal to ARPA
To: JMC@SU-AI.ARPA
cc: LES@SU-AI.ARPA, BScott@SU-SCORE.ARPA
John Machado at Navelex called this morning. He wanted your phone number,
and said he intended to call you about this proposal. I told him that I
was not sure when you would be in, and suggested that it would certainly
be appropriate for him to talk with Les. He said that it was necessary
for him to speak with you. I did not press this issue.
He also said that the research probably will be funded as a new task on
the ARPA umbrella proposal--maybe you already knew this.
Betty
-------
∂23-May-85 1149 YAO@SU-SCORE.ARPA [Andrew Yao <YAO@SU-SCORE.ARPA>: interview candidate]
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 23 May 85 11:48:58 PDT
Date: Thu 23 May 85 11:22:42-PDT
From: Andrew Yao <YAO@SU-SCORE.ARPA>
Subject: [Andrew Yao <YAO@SU-SCORE.ARPA>: interview candidate]
To: JMC@SU-AI.ARPA
John, I'm sorry that I sent the following to the wrong address the first time.
Now I got it right.
--Andy
---------------
Mail-From: YAO created at 22-May-85 13:41:37
Date: Wed 22 May 85 13:41:37-PDT
From: Andrew Yao <YAO@SU-SCORE.ARPA>
Subject: interview candidate
To: papa@SU-SCORE.ARPA, mjc@SU-AI.ARPA, ashok@SU-SCORE.ARPA
cc: nilsson@SU-SCORE.ARPA, yao@SU-SCORE.ARPA
In our last meeting of the search committee, one of the dozen or so candidates
remaining on the list is Umesh Vazirani. I would be interested in having
him come down in the near future to give a talk, and meet with students, etc.
Would you be in favor of this? I think it would be good if we get to see
all these candidates when we have a chance, instead of trying to squeeze
them into a few weeks in the future. Also, Umesh is going away for one or
two months after the beginning of June. So if we want to have him come
down in the near future, we have to do it in a week or ten days.
Thanks.
--Andy
-------
-------
∂23-May-85 1247 TREITEL@SU-SUSHI.ARPA re: International Debate (from SAIL's BBOARD)
Received: from SU-SUSHI.ARPA by SU-AI.ARPA with TCP; 23 May 85 12:47:39 PDT
Date: Thu 23 May 85 12:47:17-PDT
From: Richard Treitel <TREITEL@SU-SUSHI.ARPA>
Subject: re: International Debate (from SAIL's BBOARD)
To: avg@SU-AIMVAX.ARPA
cc: JMC@SU-AI.ARPA, su-bboards@SU-AIMVAX.ARPA, treitel@SU-SUSHI.ARPA
In-Reply-To: Message from "Allen VanGelder <avg@diablo>" of Thu 23 May 85 11:28:25-PDT
This reminds me of a book I read some long time ago, written by two English
undergrads who had just been on a debating tour of Eastern U.S. (and Canadian,
for that matter) colleges. They characterised the American mode of debate as
leading to the victory of "those who know most, and care least, about the
problem (if there is one) of the unemployed (if there are any)." That year's
motion was That The Federal Government Should Institute A Public Works Program
To Deal With The Problem Of The Unemployed. The authors gave a brief digest
of the tactics used by one debate team to oppose this motion:
"First, we shall prove that there is no problem. Second, we shall prove that
if there is a problem, it is not a problem of the unemployed. Third, that if
there is a problem of the unemployed, a public works program is not the right
way to deal with it. Fourth, if there is a public works program, it should
not be instituted by the Federal Government."
Am I the only one to go Bletch upon reading this?
- Richard
-------
∂23-May-85 1300 JMC
inference about nov. 20 conflict
∂23-May-85 1330 TULEY@SU-SCORE.ARPA message
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 23 May 85 13:29:57 PDT
Date: Thu 23 May 85 13:30:10-PDT
From: Kimberly Tuley <TULEY@SU-SCORE.ARPA>
Subject: message
To: jmc@SU-AI.ARPA
John Machado called - he says that it's urgent that he talk with you -
will be available about 3:00 our time. ph: 703-590-5472
Kim
-------
≤100k and stanford only in 85
there has to be a milestone to terminate task on
6 or 9 month
announcement in cbd soliciting a proposals in this and other areas
and we respond with a proposal to do the rest of the work. This should
include Berkeley and Lucid.
The above is a home number, but he'll be at home tomorrow.
∂23-May-85 1432 TULEY@SU-SCORE.ARPA Tech Board
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 23 May 85 14:32:19 PDT
Date: Thu 23 May 85 14:32:13-PDT
From: Kimberly Tuley <TULEY@SU-SCORE.ARPA>
Subject: Tech Board
To: jmc@SU-AI.ARPA
Rodgers from Sequent would like to speak with you re techboard at (603)
626-5700
-------
∂23-May-85 1651 DAVIES@SU-CSLI.ARPA re: International Debate (from SAIL's BBOARD)
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 23 May 85 16:51:08 PDT
Date: Thu 23 May 85 16:49:41-PDT
From: Todd Davies <DAVIES@SU-CSLI.ARPA>
Subject: re: International Debate (from SAIL's BBOARD)
To: JMC@SU-AI.ARPA
cc: OTHER-SU-BBOARDS@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Wed 22 May 85 21:16:00-PDT
As it happens, Stanford will be arguing the affirmative tonight--that the
survival of the world does require collectivism. In general, JMC is right,
which school takes which side is not considered important. Academic debators
consider it their responsibility to be able to argue both sides of any
question--a bizarre idea to some, I admit. Sometimes the sides are determined
by a coin-flip. In this case, Stanford proposed the topic and Oxford as the
visitors were given their choice of which side to support. I have been asked
to mention that the debate, which is in TERMAN AUDITORIUM (not Bishop as
previously reported) at 8:00 tonight, is being supported by funds from
Overseas Studies and the Program Board.
-------
∂24-May-85 1110 OHLANDER@USC-ISI.ARPA Funding for Common Lisp and Benchmarking
Received: from USC-ISI.ARPA by SU-AI.ARPA with TCP; 24 May 85 11:10:33 PDT
Date: 24 May 1985 14:10-EDT
Sender: OHLANDER@USC-ISI.ARPA
Subject: Funding for Common Lisp and Benchmarking
From: OHLANDER@USC-ISI.ARPA
To: JMC@SU-AI.ARPA
Cc: Kahn@USC-ISI.ARPA, Squires@USC-ISI.ARPA, Scott@SU-SCORE.ARPA
Message-ID: <[USC-ISI.ARPA]24-May-85 14:10:08.OHLANDER>
John,
There are a number of things to be accomplished in terms of
Common Lisp and benchmarking of lisp machines. Dick Gabriel has
left Stanford but he is willing to carry out some of the tasks
that were originally funded for Stanford to accomplish. Among
the efforts that we need some progress on are: the blue and
yellow pages, verification of Common Lisp compilers, and
benchmarking of new machines. Dick Gabriel is putting together a
tasking statement to address these concerns. The money to fund
this task resides at Stanford. According to our records, $273K
was put out in FY84. An additional $287K has been sent from
DARPA and is either at Stanford or soon will be. There is an
additional $303K to be put out in FY86. What we want to happen
is that Stanford subcontract to Lucid to accomplish the things
that we need, as specified under the original contract. We may
also include some research for Q-Lambda. We all have to converge
on what is to be done with that money as soon as possible. As
soon as we get the proposed tasking statement from Gabriel, we
will be requesting that Stanford arrange to provide the money to
Lucid.
Ron Ohlander
∂24-May-85 1112 BSCOTT@SU-SCORE.ARPA
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 24 May 85 11:11:53 PDT
Date: Fri 24 May 85 11:11:55-PDT
From: Betty Scott <BSCOTT@SU-SCORE.ARPA>
To: JMC@SU-AI.ARPA
cc: BSCOTT@SU-SCORE.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Fri 24 May 85 10:11:00-PDT
Hiring Sarah sounds great, John. We had made other arrangements, but that
can be cancelled. Have Sarah come by and fill out new forms, etc. Probably
the $9/hour is still a reasonable rate--or do you want to give her an in-
crease. It's up to you.
Betty
-------
∂24-May-85 1145 BSCOTT@SU-SCORE.ARPA Re: Sarah
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 24 May 85 11:45:52 PDT
Date: Fri 24 May 85 11:45:38-PDT
From: Betty Scott <BSCOTT@SU-SCORE.ARPA>
Subject: Re: Sarah
To: JMC@SU-AI.ARPA
cc: BSCOTT@SU-SCORE.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Fri 24 May 85 11:43:00-PDT
Will do. - Betty
-------
∂24-May-85 1157 TULEY@SU-SCORE.ARPA Robotics Search Committee Meeting
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 24 May 85 11:57:39 PDT
Date: Fri 24 May 85 11:55:39-PDT
From: Kimberly Tuley <TULEY@SU-SCORE.ARPA>
Subject: Robotics Search Committee Meeting
To: jmc@SU-AI.ARPA
Hello,
Nils asked me to send you a reminder about the Robotics Search Committee Meeting
today at 3:15 in the Chairman's Conference Room (MJH 220).
Kim
-------
∂24-May-85 1440 AI.WOODY@MCC.ARPA Re: yet another postponement
Received: from MCC.ARPA by SU-AI.ARPA with TCP; 24 May 85 14:40:41 PDT
Date: Fri 24 May 85 16:39:46-CDT
From: Woody Bledsoe <AI.Woody@MCC.ARPA>
Subject: Re: yet another postponement
To: JMC@SU-AI.ARPA
cc: AI.Woody@MCC.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Fri 24 May 85 12:14:00-CDT
John,
Yes June 10,11 will be fine. I will be out of the office for part of
the 10th, but it may be even better. Bob Boyer leaves for Edinburgh
(for the Summer) on June 12, but says that he will be able to be
here a good deal of the time that you are here. We will change
your reservations accordingly. I'm glad that you can come.
Woody
-------
∂24-May-85 1508 NILSSON@SU-SCORE.ARPA AI "Retreat"
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 24 May 85 15:07:59 PDT
Date: Fri 24 May 85 15:07:09-PDT
From: Nils Nilsson <NILSSON@SU-SCORE.ARPA>
Subject: AI "Retreat"
To: Feigenbaum@SUMEX-AIM.ARPA, Genesereth@SUMEX-AIM.ARPA, TW@SU-AI.ARPA,
JMC@SU-AI.ARPA, Rosenbloom@SUMEX-AIM.ARPA, Buchanan@SUMEX-AIM.ARPA
cc: nilsson@SU-SCORE.ARPA
Here's a proposal: Let's us AI faculty get together for a few hours (or
a day, or two days --depending on what people think is appropriate) for
some discussions about "whither AI at Stanford." One important topic for
our agenda would be who should our next AI faculty appointment(s) be? We
might also want to talk about AI courses, advising students, comp and qual
matters, coordination of research projects, etc. Ed Feigenbaum has
kindly offered his Tamales Bay house if we want to put a few miles between
us and Stanford. Other possibilities include the Buck Estate in Menlo Park
or one of our own houses for an all-day session. (The Nilsson house is
certainly available.) The weekend of July 13-14 has been mentioned as
a possibility, although we might also settle on one or two mid-week days
in the summer. Please let me know what you think of the idea, suggestions
for topics that need our joint attention, ideas about venue, and constraints
on time. -Nils
-------
∂24-May-85 1651 JMM Faculty Search suggestion
To: nilsson@SU-SCORE.ARPA
CC: JMC@SU-AI.ARPA, TOB@SU-AI.ARPA
This is probably quite belated and may appear to be an outlandish
suggestion. Jan Kooenderink from the University of Utrecht has done
very good work in Vision from a mathematical perspective. He is
primarily a mathematician(differential geometer/topologist) who has
been working on Vision problems for the last 10 years. He does not call
himself an AI person and publishes in journals like Perception, Biological
Cybernetics etc and so his work is not very well known in the US AI
community. His work on shading is probably more general than
Horn's work at MIt and on some aspects of occluding contour analysis
vastly superior to David Marr's work.
Of course this work is not in the standard style of AI/Vision work and
many people in Vision may consider his work not substantial because it
is not backed up by computer implementations.
Jitendra
∂24-May-85 1847 VAL situation calculus
It seems a good idea to replace "possible" by "exists" in my axioms. Then we
may apply "possible" to events and view it as an abbreviation: possible(e,s)
stands for exists result(e,s). Apparently "exists" in most cases will be used
in this context. In particular, many axioms may be made shorter if this
abbreviation is introduced.
∂25-May-85 1454 POURNE@MIT-MC Pournelle's story
Received: from MIT-MC.ARPA by SU-AI.ARPA with TCP; 25 May 85 14:54:36 PDT
Date: Sat, 25 May 85 17:53:29 EST
From: Jerry E. Pournelle <POURNE@MIT-MC>
Subject: Pournelle's story
To: JMC@SU-AI
cc: shahn@SUMEX-AIM
In-reply-to: Msg of 23 Dec 84 1056 PST from John McCarthy <JMC at SU-AI.ARPA>
Message-ID: <[MIT-MC].518377.850525.POURNE>
I continue to tell the original story, trhus adding my
contribution to funding...
prize is good idea. I will rumor it often.
robots e searching the air ducts...
see you at AAAS?
jep
∂25-May-85 1511 POURNE@MIT-MC urgent change
Received: from MIT-MC.ARPA by SU-AI.ARPA with TCP; 25 May 85 15:11:01 PDT
Date: Sat, 25 May 85 18:08:26 EST
From: Jerry E. Pournelle <POURNE@MIT-MC>
Subject: urgent change
To: jmc@SU-AI
Message-ID: <[MIT-MC].518391.850525.POURNE>
Tuesday 28 May I am ALAS, already engaged my wife informs me.
Our publishers Judy Lynn and Lester del Rey will be down from
the ABA in San Francisco just to take Niven and I to dinner. If
you are staying over Wednesday can we have dinner Wedneseday?
Regrets. Will see you in daytime Tuesday. Best
∂25-May-85 1518 CLT
if its ok, it would rather not go to supper tonight
we could try for supper at home tomorrow if you like
∂25-May-85 1519 CLT oops
make that ``i would'' not ``it would''
∂25-May-85 1531 POURNE@MIT-MC urgent change
Received: from MIT-MC.ARPA by SU-AI.ARPA with TCP; 25 May 85 15:31:05 PDT
Date: Sat, 25 May 85 18:28:21 EST
From: Jerry E. Pournelle <POURNE@MIT-MC>
Subject: urgent change
To: JMC@SU-AI
In-reply-to: Msg of 25 May 85 1514 PDT from John McCarthy <JMC at SU-AI.ARPA>
Message-ID: <[MIT-MC].518416.850525.POURNE>
no decision needed. will arrange dinner party for wednesday,
proabably about 10 people, no problem adding you or not if you
are available, hope you can make it. niven, myself, vaughn, ed
hume, rolf sinclair probable others.
jep
see you tuesday.
∂26-May-85 1457 CLT calendar item
sat 1-jun 14:00 onwards Beeson party
should arrive by 4pm to not miss the music,
champagne, and other events
∂26-May-85 1642 GENESERETH@SUMEX-AIM.ARPA qual schedule
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 26 May 85 16:41:59 PDT
Date: Sun 26 May 85 16:41:45-PDT
From: Michael Genesereth <GENESERETH@SUMEX-AIM.ARPA>
Subject: qual schedule
To: TOB@SU-AI.ARPA, Buchanan@SUMEX-AIM.ARPA, Feigenbaum@SUMEX-AIM.ARPA,
JMC@SU-AI.ARPA, Nilsson@SU-SCORE.ARPA, Rosenbloom@SUMEX-AIM.ARPA,
tw@SU-AI.ARPA
Gentlemen,
Well, it appears that everyone who has responded can make it the
mrning of June 13. Since there are only 4 students, we
should be able to finish up in the morning. I'd appreciate
it if you could all block out 9:00-1:00 on that Thursday. I'll
be sending around detailed info on the format and specific
committee assignments as soon as I get back from Italy next week.
mrg
-------
∂26-May-85 2057 ucscc!beeson%ucscd.ucscc.UUCP@Berkeley Lifschitz's comments on my paper and my reply
Received: from UCB-VAX.ARPA by SU-AI.ARPA with TCP; 26 May 85 20:57:22 PDT
Received: by UCB-VAX.ARPA (4.24/4.46)
id AA04789; Sun, 26 May 85 20:54:26 pdt
Received: from ucscd.UCSC (ucscd.ARPA) by ucscc.UCSC (4.12/4.7)
id AA28539; Sat, 25 May 85 12:11:47 pdt
Received: by ucscd.UCSC (4.12/4.7)
id AA06134; Sat, 25 May 85 12:08:43 pdt
Date: Sat, 25 May 85 12:08:43 pdt
From: ucscc!beeson%ucscd.ucscc.UUCP@Berkeley (20012000)
Message-Id: <8505251908.AA06134@ucscd.UCSC>
To: su-ai.jmc@Berkeley
Subject: Lifschitz's comments on my paper and my reply
Cc: arpa!clt%ucbvax!su-ai.ucscc.UUCP@Berkeley
Date: 23 May 85 1059 PDT
From: Vladimir Lifschitz <ucbvax!VAL@SU-AI.ARPA>
Subject: Logic and Knowledge
To: beeson@ucscd.ucscc.UUCP
I just finished reading your very interesting paper. I'm afraid I couldn't
quite appreciate some of the details because of my insufficient understanding
of PROLOG. Here are some questions and remarks.
1. It seems that a basic idea of McCarthy's approach to knowledge representation is
that knowledge should be represented in a form not related to any particular way of
using it (at least, in most cases). His favorite example is: "There is usually
a noise when things collide". You can use this fact to make noise, or to avoid
noise, or to explain noise, but in each case you use the same commonsense fact.
What is your attitude towards that? It appears that your formalism rejects this
idea from the very beginning. Maybe you should comment on that in the paper.
2. Your analysis of default reasoning in Sec. 1 differs in one respect from
what seems to be the usual understanding. Usually we assume by default that
the contraindications do not apply unless we know that their preconditions are
satisfied. That is, when we want to decide whether the bird Tweety can fly,
we check whether any information is available that would imply C1, C2,... .
If not, we conclude that it can. From this point of view, default reasoning
is reasoning with incomplete information. This differs from your approach:
we look at C1, C2,... when trying to apply the rule and do not wait until
"something goes wrong". This is apparently the way default reasoning is understood
in Reiter's default logic, in closed-world data bases, in predicate completion
and in circumscription. What is the relationship between this understanding and
yours.
3. The description of reasoning in "subjunctive mode" in Section 5 reminded me the
distinction between "operators" and "action routines", made very clear in the
paper about the STRIPS planning system by Fikes and Nilsson in AI Journal 2(1971),
189-208. They say: "Operators are the basic elements from which a solution is
built. For robot problems, each operator corresponds to an action routine whose
execution causes a robot to take certain actions." And then in a footnote:
"The reader should keep in mind the distinction between an operator and its
associated action routine. Execution of action routines actually causes the robot
to take actions. Application of operators to world models occurs during the
planning (i.e., problem solving) phase when an attempt is being made to find a
sequence of operators whose associated action routines will produce a desired
state of the world".
4. In the first example in Sec. 12, z=x should be apparently z=y.
5. I don't quite understand your use of "can" in the example of Sec. 13. It
looks as if you were giving a rule for determining what we are physically able
to do with the blocks. You don't use "can" in other examples. Is there any reason
for that?
- Vladimir
And now here is my reply
Thanks for your helpful comments and for the reference, of which I was
unaware. I was aware that waiting until something goes wrong to check
the default conditions is not the way people view default reasoning,
but I think it is a useful innovation. Sometimes it is not correct,
however, as in the following rule for driving on a freeway:
if on a freeway
then drive at whatever speed you consider safe and expedient
except if you see a policeman
then drive 55
except if the policemean's car is stopped
and he is busy with another motorist
then drive at whatever speed you consider safe and expedient.
You better not wait until something goes wrong to check for policemen!
Thus my semantics does not correspond in every situation to the natural
one. But in many it does, and as a programming language for AI it can
be made to do. In general the exceptional conditions are of two kinds,
those that have to be checked before the action, and those that should not
be checked until something goes wrong.
A more sophisticated version of my system would include an explicit
representation of time, or at least the sequence of events, together with
parallel execution of situations and the ability of one procedure to
interrupt another. Once this is done, I will be able to distinguish the
above kinds of exceptions better. In the current system, it is the
programmer's job to put the kind that have to be checked first in the
if-part, instead of in the except-part. See the footnote in the
travel example for one example of this.
As to your point about using the same knowledge different ways,
I think my system does that fine. The example you give,
if collides(x,y)
then noise
except if you are too far away
or x and y are in a vacuum
is a very general rule and would belong to the collection of
rules shared by many specific situations. That is, in all the
situations I considered as examples, it would be a rule inherited from
the supersituation. Thus in one situation, that rule might be used
to avoid noises, and in another situation it might be used to
create noises.
In the next draft of the paper, I shall certainly bring this point
out better to avoid creating the misimpression you received.
∂28-May-85 0511 OHLANDER@USC-ISI.ARPA re: Funding for Common Lisp and Benchmarking
Received: from USC-ISI.ARPA by SU-AI.ARPA with TCP; 28 May 85 05:11:02 PDT
Date: 28 May 1985 08:10-EDT
Sender: OHLANDER@USC-ISI.ARPA
Subject: re: Funding for Common Lisp and Benchmarking
From: OHLANDER@USC-ISI.ARPA
To: JMC@SU-AI.ARPA
Cc: Kahn@USC-ISI.ARPA, LES@SU-AI.ARPA
Cc: Squires@USC-ISI.ARPA, Bscott@SU-SCORE.ARPA
Message-ID: <[USC-ISI.ARPA]28-May-85 08:10:38.OHLANDER>
In-Reply-To: The message of 24 May 85 1122 PDT from John McCarthy <JMC@SU-AI.ARPA>
John,
Thanks for your prompt reply. We will try to get all of this
straightened out as soon as possible.
Ron Ohlander
∂28-May-85 0712 CL.BOYER@UTEXAS-20.ARPA
Received: from UTEXAS-20.ARPA by SU-AI.ARPA with TCP; 28 May 85 07:12:36 PDT
Date: Tue, 28 May 1985 09:12 CDT
From: CL.BOYER@UTEXAS-20.ARPA
To: John McCarthy <JMC@SU-AI>
In-reply-to: Msg of 27 May 1985 19:54-CDT from John McCarthy <JMC at SU-AI.ARPA>
I'm sorry to report that under pressure from Dantzig I sent
the eulogy on to him on Friday.
∂28-May-85 0905 NILSSON@SU-SCORE.ARPA Duda
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 28 May 85 09:05:11 PDT
Date: Tue 28 May 85 09:05:25-PDT
From: Nils Nilsson <NILSSON@SU-SCORE.ARPA>
Subject: Duda
To: jmc@SU-AI.ARPA
cc: nilsson@SU-SCORE.ARPA
John, I mentioned the possibility of being a "VIP" to Dick Duda
recently. In my opinion he would do an absolutely outstanding job
of giving a course on expert systems. Dick is pretty busy through
next academic year but might be interested in teaching a course
in '86-'87. He works at Syntelligence (408) 745-6666. -Nils
-------
∂28-May-85 1113 BOSACK@SU-SCORE.ARPA Re: xgp
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 28 May 85 11:12:58 PDT
Date: Tue 28 May 85 11:13:09-PDT
From: Len Bosack <BOSACK@SU-SCORE.ARPA>
Subject: Re: xgp
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Mon 27 May 85 22:55:00-PDT
We managed to mess up on the timing of its move. The XGP is supposed
to resume service in the basement. Its former space is to hold another Dover
printer. The XGP was supposed to move NEXT week.
Before we can retire the XGP, I think we have to make a version of PUB
that can print on our other printers. Don Woods did much of the work and
we have his version. I am prospecting for a student to finish the
job this Summer.
Is there other software people depend on that should be worked over?
Len
-------
∂28-May-85 1508 AAAI-OFFICE@SUMEX-AIM.ARPA Computer in Mathematics Conference
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 28 May 85 15:07:28 PDT
Date: Tue 28 May 85 15:06:35-PDT
From: AAAI <AAAI-OFFICE@SUMEX-AIM.ARPA>
Subject: Computer in Mathematics Conference
To: ai.woody@MCC.ARPA, jmc@SU-AI.ARPA
cc: aaaI-OFFICE@SUMEX-AIM.ARPA
Telephone: (415) 328-3123
Postal-Address: 445 Burgess Drive, Menlo Park, CA 94025
Woody & John,
I haven't heard a word from David Chudnovksy or Dick Jenks about
their submittal of a letter asking for support for their
conference. If the AAAI will be assisting them, we will need
to accomodate them in next year's budget and naturally have
their request approved by the conference committee.
Do you know anything?
Thxs,
Claudia
-------
∂28-May-85 1551 AI.WOODY@MCC.ARPA Re: Computer in Mathematics Conference
Received: from MCC.ARPA by SU-AI.ARPA with TCP; 28 May 85 15:51:22 PDT
Date: Tue 28 May 85 17:50:18-CDT
From: Woody Bledsoe <AI.Woody@MCC.ARPA>
Subject: Re: Computer in Mathematics Conference
To: AAAI-OFFICE@SUMEX-AIM.ARPA, jmc@SU-AI.ARPA
cc: AI.Woody@MCC.ARPA
In-Reply-To: Message from "AAAI <AAAI-OFFICE@SUMEX-AIM.ARPA>" of Tue 28 May 85 17:05:53-CDT
No I have not heard anything recently from them. Woody
-------
∂28-May-85 1606 MOGUL@SU-SCORE.ARPA re: "The action may be punitive".
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 28 May 85 16:06:36 PDT
Date: Tue 28 May 85 15:53:22-PDT
From: Jeffrey Mogul <MOGUL@SU-SCORE.ARPA>
Subject: re: "The action may be punitive".
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Fri 17 May 85 22:24:00-PDT
Sorry it took so long for me to respond, I've been out of town until
today and I've got hundreds of messages to read. Briefly:
I can't cite an "analysis of the left's mistakes of the 60s" but
I am almost positive that they exist. You must realize that I am
not talking about a monolithic "left", just as the "right" is not
a monolith. There are certainly violent leftists in the US and
elsewhere, and I don't mean to include every leftist in my imprecise
phrasing. Certainly, as I said in an earlier message, there are
"left wing" groups such as the Abalone Alliance that explicitly
reject violence, and take steps to avoid it.
By "fundamental change" I intend to be vague, precisely because
there is no universal vision of the future among leftists. Certainly
some of these visions are at significant variance with the world,
or the country, as it now exists. I think you and I can agree on
the need for fundamental change in the USSR, and presumably in
S. Africa, and might even agree on the rudiments of what should
come after. You may not have any disagreement with the way
things work in this country, but there are people who believe
differently.
If you want specifics of MY vision, you'll have to wait until
I have time to write a few pages. Rest assured that I don't
believe in a new revolution. Don't count on agreeing with my
vision, though ... so if you're happy with the way things are,
maybe you won't like it if I get my wishes.
-Jeff
-------
∂29-May-85 1252 vardi@diablo Daniel Lehman
Received: from SU-AIMVAX.ARPA by SU-AI.ARPA with TCP; 29 May 85 12:50:10 PDT
Date: Wed, 29 May 85 10:43:54 pdt
From: Moshe Vardi <vardi@diablo>
Subject: Daniel Lehman
To: barwise@csli, jmc@sail, pratt@diablo, zm@sail
Daniel Lehman will be at Stanford this Thursday and next Tuesday. He'd like
to meet with you. Let me know if and when you'll be available.
Moshe
∂29-May-85 1310 HEDGES@SU-SCORE.ARPA Japan Trip
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 29 May 85 13:10:08 PDT
Date: Wed 29 May 85 09:16:45-PDT
From: Karen Hedges <HEDGES@SU-SCORE.ARPA>
Subject: Japan Trip
To: JMC@SU-AI.ARPA
cc: RA@SU-AI.ARPA
I am forwarding a message from Bernard Galler regarding the Tsukuba Expo.
Karen
17-May-85 17:50:47-PDT,868;000000000001
Return-Path: <@MIT-MULTICS.ARPA:Bernard←Galler@UMich-MTS.Mailnet>
Received: from MIT-MULTICS.ARPA by SU-SCORE.ARPA with TCP; Fri 17 May 85 17:49:10-PDT
Received: from UMich-MTS.Mailnet by MIT-MULTICS.ARPA with Mailnet id <2662677305479665@MIT-MULTICS.ARPA>; 17 May 1985 20:35:05 edt
Date: Fri, 17 May 85 10:01:06 EDT
From: Bernard←Galler%UMich-MTS.Mailnet@MIT-MULTICS.ARPA
To: hedges@SU-SCORE.ARPA
Message-ID: <773532@UMich-MTS.Mailnet>
May I ask another favor, please? I don't seem to have John McCarthy's
net address, either (What is it?). Phyllis at Omega Travel, who is handling
the arrangements for our seminar, has not been able to get hold of John,
and there is no way that he will get travel support if it doesn't go
through her. Could you please call his office and tell them to get him to
call her *right away*? (1-800-828-2323). Many thanks.
-------
∂29-May-85 1335 udi%wisdom.bitnet@WISCVM.ARPA Re: Your letter of April 10
Received: from WISCVM.ARPA by SU-AI.ARPA with TCP; 29 May 85 13:27:31 PDT
Received: from (UDI)WISDOM.BITNET by WISCVM.ARPA on 05/29/85 at
11:02:32 CDT
From: Ehud Shapiro <udi%wisdom.bitnet@WISCVM.ARPA>
Date: Wed, 29 May 85 18:35:43 -0200
To: jmc@su-ai.arpa
Subject: Re: Your letter of April 10
Cc: udi%wisdom.bitnet@WISCVM.ARPA
Dear John,
Thanks for your letter of April 10, and sorry for my late reply.
I am interested in exploring the possibility of joining your
faculty.
I will be visiting the U.S. twice this summer, in July and in August,
although I have planned to come to the West Coast only in August. Perhaps
we could discuss matters further then, if it fits your schedule.
Sencerely
Ehud Shapiro
p.s. I am sending this letter and resume also air-mail. If you
want any clarification, or would like to start a discussion earlier,
please let me know.
∂29-May-85 1459 YAO@SU-SCORE.ARPA interview
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 29 May 85 14:59:42 PDT
Date: Wed 29 May 85 14:22:01-PDT
From: Andrew Yao <YAO@SU-SCORE.ARPA>
Subject: interview
To: ashok@SU-SCORE.ARPA
cc: papa@SU-SCORE.ARPA, jmc@SU-AI.ARPA, nilsson@SU-SCORE.ARPA, yao@SU-SCORE.ARPA
Ashok, I just talked to Umesh Vazirani. He will be gone in three days, and
will be back July 8th, and basically free for the rest of July. Could you
set up a talk and meeting with people sometime in July? I will be around
and available during that period.
It would be nice if you can contact him before he goes. His number is (415)-642-8204 (office), and also (415)-843-7000 (home).
Thanks.
--Andy
-------
∂30-May-85 0634 POURNE@MIT-MC.ARPA dinner time
Received: from MIT-MC.ARPA by SU-AI.ARPA with TCP; 30 May 85 01:02:40 PDT
Date: Thu, 30 May 85 04:03:21 EST
From: Jerry E. Pournelle <POURNE@MIT-MC.ARPA>
Subject: dinner time
To: JMC@SU-AI.ARPA
In-reply-to: Msg of 28 May 85 0006 PDT from John McCarthy <JMC at SU-AI.ARPA>
Message-ID: <[MIT-MC.ARPA].523924.850530.POURNE>
trust all worked out. jep
Date: 28 May 85 0006 PDT
From: John McCarthy <JMC at SU-AI.ARPA>
To: pournelle at MIT-MC.ARPA
Re: dinner time
The last flight to SF from LA is at ten. If convenient for you it would
be convenient for me to have dinner on Wednesday at a time and place that
would permit me to make it.
∂30-May-85 0645 JF@SU-SUSHI.ARPA June money due for MJH coffee pool
Received: from SU-SUSHI.ARPA by SU-AI.ARPA with TCP; 29 May 85 16:56:27 PDT
Date: Wed 29 May 85 16:56:06-PDT
From: Joan Feigenbaum <JF@SU-SUSHI.ARPA>
Subject: June money due for MJH coffee pool
To: tom@SU-SCORE.ARPA, ark@SU-AI.ARPA, vsingh@SUMEX-AIM.ARPA,
upfal@SU-AIMVAX.ARPA, almquist@SU-SCORE.ARPA, andy@SU-SUSHI.ARPA,
dale@SU-NAVAJO.ARPA, lance@SU-PESCADERO.ARPA, woodfill@SU-SCORE.ARPA,
pierce@SU-SCORE.ARPA, golub@SU-SCORE.ARPA, ma@SU-AI.ARPA, ym@SU-AI.ARPA,
bjork@SU-SUSHI.ARPA, gcole@SU-SUSHI.ARPA, mmt@SU-GREGORIO.ARPA,
nilsson@SU-SCORE.ARPA, jfinger@SUMEX-AIM.ARPA, unruh@SU-AIMVAX.ARPA,
les@SU-AI.ARPA, parkes@SU-SUSHI.ARPA, jjw@SU-AI.ARPA,
gangolli@SU-SCORE.ARPA, pkr@SU-AI.ARPA, fy@SU-AI.ARPA, maslen@SU-SCORE.ARPA,
morris@SU-AIMVAX.ARPA, jf@SU-SUSHI.ARPA, jmc@SU-AI.ARPA, tw@SU-AI.ARPA,
rww@SU-AI.ARPA, zzz@SU-AI.ARPA, lgd@SU-AI.ARPA, ullman@SU-AIMVAX.ARPA,
treitel@SU-SUSHI.ARPA, ponceleon@SU-SCORE.ARPA, karlin@SU-SCORE.ARPA,
roistacher@SU-SUSHI.ARPA, mann@SU-PESCADERO.ARPA, baudinet@SU-SCORE.ARPA,
roy@SU-PESCADERO.ARPA, papa@SU-SCORE.ARPA, yao@SU-SCORE.ARPA
cc: su-bboards@SU-SUSHI.ARPA
June Coffee Pool money is due. Please pay me whenever you get a chance.
You can give me the money in person or slip it under my office door (mjh 325).
Recall that the suggested contribution is $5/month for regular coffee drinkers
and $2/month for regular tea drinkers. However, you may contribute whatever
you think is appropriate for the amount you really drink. Everyone (especially
visitors to the department) is welcome to an occasional cup on the house.
The coffee pool was self-supporting in its first month, and supplies were, I
think, reasonably well-coordinated. If you have complaints about coffee
blends, tell me; complain to Richard (Treitel@sushi) about tea. If you'd like
to volunteer to do pick-ups at Peet's let me know.
Finally, there are several of you who have already paid up through June--I have
accurate records; so you can just ignore this message.
Joan Feigenbaum
(jf@sushi)
-------
∂30-May-85 1051 VAL situation calculus
Just a brief note about what I was doing while you were away. I noticed that
many of my axioms for situation calculus actually are more general in nature and
can be used in any theory which deals with names. So I was essentially
developing and generalizing your treatment of the unique names hypothesis in
the Workshop paper, and I decided to describe first this "theory of names" in
a general form. Situation calculus will be a special case with some additional
axioms. What you did in the Workshop paper has to be extended in three directions.
1. We want to allow names without denotations. 2. We want to require that only
elements of the Herbrand universe are names, nothing else. (It turned out that
this is needed for moving blocks. And this is done by "domain circumscription"
reduced to predicate circumscription as in your 1980 paper). 3. We want names of
objects of different sorts. As a result I came up with a set of 12 axioms for
names and denotations, and this is probably more than half of what we need for
the blocks world.
∂30-May-85 1139 @seismo.ARPA:mcvax!kddlab!nttmecl!ccut!a1458@seismo.ARPA your visit to Japan
Received: from SEISMO.ARPA by SU-AI.ARPA with TCP; 30 May 85 11:39:40 PDT
Return-Path: <mcvax!kddlab!nttmecl!ccut!a1458>
Received: from mcvax.UUCP by seismo.ARPA with UUCP; Thu, 30 May 85 14:22:49 EDT
Received: by mcvax.UUCP; Thu, 30 May 85 18:36:10 -0200 (MET)
Received: by kddlab.UUCP (4.12/4.7)
id AA15909; Thu, 30 May 85 22:00:15 jst
Received: by nttmecl.UUCP (4.12/4.7)
id AA26144; Thu, 30 May 85 21:32:21 jst
Received: by ccut.UUCP (4.12/4.7)
id AA13976; Thu, 30 May 85 18:18:44+0900
From: mcvax!kddlab!nttmecl!ccut!a1458@seismo.ARPA (Masahiko Sato)
Date: 30 May 1985 18:08-GMT+9:00
Subject: your visit to Japan
To: seismo!jmc@su-ai.ARPA
Message-Id: <85/05/30 1808.910@ccut.UUCP>
If I remember correctly, I think that you will be visiting Japan
sometime in June. If you need any help while you are in Japan, please
let me know. Following are my telephone numbers:
Office: [03]812-2111 ext 4111 (secretary)
Home: [0471]32-4568
Unfortunately, I will not be in Japan from June 7 until June 14 as I
will be attending a workshop on specification of programs held in
Marstrand, Sweden.
This year three of us will be visting Stanford from July 1 to August 31.
I sent a message to clt with regard to this.
I am looking forward to seeing you soon.
∂30-May-85 1236 YAO@SU-SCORE.ARPA Re: Your letter of April 10
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 30 May 85 12:36:31 PDT
Date: Thu 30 May 85 12:36:39-PDT
From: Andrew Yao <YAO@SU-SCORE.ARPA>
Subject: Re: Your letter of April 10
To: JMC@SU-AI.ARPA
cc: papa@SU-SCORE.ARPA, nilsson@SU-SCORE.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Thu 30 May 85 00:03:00-PDT
Since Shapiro is on both Nil's and your list, I think we should invite
him to give a talk and meet people here.
I have four or five new applications forwarded from Nils. Perhaps when
you have heard from most of the people you sent letters to, we should have
another committee meeting to look over these applications.
--Andy
-------
∂30-May-85 1306 SMC
I'll be right back, I've got to feed my parking meter.
∂30-May-85 1537 CN.MCS@Lindy
Received: from SU-LINDY.ARPA by SU-AI.ARPA with TCP; 30 May 85 15:37:10 PDT
Date: Thu, 30 May 85 15:36:12 PDT
From: <CN.MCS@Forsythe>
To: JMC@SAIL
John,
I need some comments from you on how you use the libraries
and your need for library services. The reason I am asking
these questions is that with the Near West Developments
there is some talk of a reconfiguration of libraries.
All of this is strictly in the initial idea stage. However
some of the suggestions have included: an EE/CS library
of its own with a separate mathematical sciences library;
EE/CS and Math sciences together; and other variations
involving physics. One of the issues I have raised is
the need for the mathematically oriented researcher to
have easy access to the older material which raises the
issue of what can be stored. I will be gathering some
data on the use of our journals but expect to find
a lot of random use of the math journals over a long
period of time.
I assume you often use libraries by browsing. How effective
are online notices of new books and new technical reports in
serving this browsing need? Can you do a substantial amount
of preparatory work before coming to the library by
searching the online catalog and the online technical reports
file which should be up by the fall? Is the technology
available to send digitized facsimiles of contents pages
of journals? This would not provide a database that could
be searched by author and title but would serve a current
awareness service?
Basically, what would be your main concerns in a discussion
concerning the rearrangement of libraries?
Any comments will be appreciated.
Harry
∂30-May-85 2049 vardi@diablo re: Daniel Lehman
Received: from SU-AIMVAX.ARPA by SU-AI.ARPA with TCP; 30 May 85 20:49:49 PDT
Date: Thu, 30 May 85 18:06:17 pdt
From: Moshe Vardi <vardi@diablo>
Subject: re: Daniel Lehman
To: JMC@Sail
Could you meet with Danny sometime on Tuesday morning?
(Yes, Zohar is apparently in Israel.)
Moshe
∂30-May-85 2057 CLT msg from rpg
∂30-May-85 1439 RPG Varia
To: LES@SU-AI.ARPA, fateman%ucbdali@UCB-VAX.ARPA, CLT@SU-AI.ARPA
CC: RPG@SU-AI.ARPA
In the 4 months to a year category there are several things we can start
on. We can start the design for Qlisp for the eventual machine. We can
do a much more detailed simulator for the 3600 environment. We can produce
the language definition for Qlisp.
Once more money and the multiprocessor show up we can start on the
implementation of Qlisp.
-rpg-
∂30-May-85 2147 MRC@SU-SCORE.ARPA more on Czechoslovakian VAX
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 30 May 85 21:47:09 PDT
Date: Thu 30 May 85 21:47:28-PDT
From: Mark Crispin <MRC@SU-SCORE.ARPA>
Subject: more on Czechoslovakian VAX
To: JMC@SU-AI.ARPA, SU-BBoards@SU-SCORE.ARPA
Postal-Address: 725 Mariposa Ave. #103; Mountain View, CA 94041-1869
Phone: 1 (415) 968-1052
The article claimed that the VAX in question was shipped from
the US in December 1980, and took a circuitous route through Haiti,
France, and Switzerland before arriving in Pilzen Zatisi, CSSR on
Feb. 24, 1981.
It is my impression that militarily useful software such as
IC layout programs are generally not written in assembly language,
so I fail to see how a VAX is going to make a difference compared
to any of a number of more powerful computing engines. In fact, I
know of very little software that *must* be run on a VAX.
That is what leads me to wonder. Are the Soviets really THAT
interested in VAXen? Do they know something we don't? A VAX makes
an alright Unix engine, but it's no longer the price/performance
leader.
I believe that it's a cover for something far more serious
leaking out.
-------
∂30-May-85 2225 POURNE@MIT-MC.ARPA dinner time
Received: from MIT-MC.ARPA by SU-AI.ARPA with TCP; 30 May 85 22:21:18 PDT
Date: Fri, 31 May 85 01:21:07 EST
From: Jerry E. Pournelle <POURNE@MIT-MC.ARPA>
Subject: dinner time
To: JMC@SU-AI.ARPA
In-reply-to: Msg of 30 May 85 1044 PDT from John McCarthy <JMC at SU-AI.ARPA>
Message-ID: <[MIT-MC.ARPA].525395.850531.POURNE>
Dinna Ken whether or not B Clifford has personality t o be
editor, but she has the ability and reliability to do most of
the actual work; perhaps assocaite editor with someone with more
visibility to be actual editor of record? Mostly we need
someone who will ←do ← the work. I agree that she probably
hasn't the visibility to be editor of record. Alas, who does
and also has time?
"Tis a problem. I will give more thought to it.
I thought it was a good dinner, and if we can get that journal
going we may do some real good.
jep
∂30-May-85 2249 TOB
I think well of Koenderink. I have known him for seven years or so
and like him. I have read almost all of his papers.
The papers are basically restatements of standard mathematics in vision.
The paper on occluding contours is better in one aspect than
Marr's. The others basically do not have any vision results, no new
contributions other than restatement of mathematics. I do not regard
Koenderink's work as among the top three in vision. I would welcome
discussing his contributions and refreshing my knowledge of his work.
∂24-May-85 1651 JMM Faculty Search suggestion
To: nilsson@SU-SCORE.ARPA
CC: JMC@SU-AI.ARPA, TOB@SU-AI.ARPA
This is probably quite belated and may appear to be an outlandish
suggestion. Jan Kooenderink from the University of Utrecht has done
very good work in Vision from a mathematical perspective. He is
primarily a mathematician(differential geometer/topologist) who has
been working on Vision problems for the last 10 years. He does not call
himself an AI person and publishes in journals like Perception, Biological
Cybernetics etc and so his work is not very well known in the US AI
community. His work on shading is probably more general than
Horn's work at MIt and on some aspects of occluding contour analysis
vastly superior to David Marr's work.
Of course this work is not in the standard style of AI/Vision work and
many people in Vision may consider his work not substantial because it
is not backed up by computer implementations.
Jitendra
∂30-May-85 2347 LES
∂30-May-85 2323 JMC
How about getting together at 11am with me and Carolyn to do 100k?
LES - Fine. I'll be there.
∂31-May-85 1011 vardi@diablo re: Daniel Lehman
Received: from SU-AIMVAX.ARPA by SU-AI.ARPA with TCP; 31 May 85 10:10:56 PDT
Date: Fri, 31 May 85 10:11:05 pdt
From: Moshe Vardi <vardi@diablo>
Subject: re: Daniel Lehman
To: JMC@Sail
OK. 11:00am.
Moshe
∂31-May-85 1047 HEDGES@SU-SCORE.ARPA Robotics Candidates
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 31 May 85 10:47:25 PDT
Date: Fri 31 May 85 10:47:35-PDT
From: Karen Hedges <HEDGES@SU-SCORE.ARPA>
Subject: Robotics Candidates
To: Cannon@SU-SIERRA.ARPA, TOB@SU-AI.ARPA, JMC@SU-AI.ARPA,
Reynolds@SU-SCORE.ARPA, BScott@SU-SCORE.ARPA
Peter Will has confirmed that he will be visiting on Monday, June 17. Nils
will not be here on that day, but Professor Cannon will meet him in Nils
office that day. Faculty and students will be contacted as to who will be
here and who would like to visit with him.
Jean Claude Latombe will be visiting on July 9. He will be available only
part of the day. Faculty and students will also be contacted regarding his
visit.
If you have any questions, please let me know.
Karen Hedges
-------
∂31-May-85 1117 SMC
Call Jack Kate 321-1225
∂31-May-85 1147 NILSSON@SU-SCORE.ARPA award
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 31 May 85 11:46:58 PDT
Date: Fri 31 May 85 11:46:59-PDT
From: Nils Nilsson <NILSSON@SU-SCORE.ARPA>
Subject: award
To: jmc@SU-AI.ARPA
cc: nilsson@SU-SCORE.ARPA
Congratulations on the IJCAI award. I'd like to send an announcement
about it around to our faculty. Any objections? -Nils
-------
∂31-May-85 1532 LES Preliminary task
To: Squires@USC-ISI.ARPA
CC: JMC@SU-AI.ARPA, CLT@SU-AI.ARPA
We understand from John Machado that it may be possible to obtain $100k
quite soon for preliminary work on Qlisp and that this would be an added
task under the existing contract. Here is a proposed project that we think
will accomplish the most in advancing possible later work. We are interested
in whether this looks appropriate.
Les Earnest
------------------
Proposal to DARPA
Evaluation of Multiprocessors for Qlisp
We propose to review available multiprocessor systems and evaluate which
one would be the best choice for a Qlisp* experimental development project.
The proposed schedule and milestones would be as follows. All dates are
in 1985.
July 1 Commence preparing a performance specification for a multiprocessor
system suitable for use in a Qlisp experimental development project.
This specification will include a requirement for uniform access
time to all memory. Also, we will compile a list of prospective
vendors.
July 15 Distribute specification to prospective vendors. Resolve any
ambiguities and issue clarifications as needed. In available time
we will do experimental programming of three typical candidate
tasks for parallel processing and evaluate the expected speedup
factors.
Sept. 1 Proposals due; evaluation begins.
Oct. 1 Evaluation completed and report issued recommending system choice.
Results of experimental programming will be reported.
-------------
* Richard Gabriel and John McCarthy, "Queue-based Multiprocessing Lisp," in
Proceedings of the 1984 ACM Symposium on Lisp and Functional Programming,
August 1984.
-------------
Stanford University proposal to DARPA
for
Qlisp on parallel processors
Preliminary budget
Three months beginning 7-1-85
Personnel
Prof. John McCarthy, Principal Invest. (15%) 3,113
Lester Earnest, Senior Res. Assoc. (100%) 16,875
Carolyn Talcott*, Research Associate (100%) 10,750
Joe Weening, Student Research Assist. (100%) 2,520
-----, Secretary (25% time) 1,740
-------
Salary subtotals 34,998
Staff benefits (24.1% initially, 8,586
25.4% beg. 9/1/85)
Travel (3 East Coast trips @ $1000, 5,500
5 Western trips @ $500)
Computer time costs (based on 1984 usage) 5,000
Other direct costs 5,088
-------
Subtotal 59,172
Indirect costs (69% of direct costs) 40,828
-------
Total 100,000
* To be appointed.
∂31-May-85 2323 ERIC@SU-CSLI.ARPA Re: job
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 31 May 85 23:23:00 PDT
Date: Fri 31 May 85 23:21:39-PDT
From: Eric Ostrom <ERIC@SU-CSLI.ARPA>
Subject: Re: job
To: JMC@SU-AI.ARPA, eric@SU-CSLI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Fri 31 May 85 02:43:00-PDT
John,
Thanks for the thought, and I will call you Monday. Things
are looking up around here too, but I'm still pretty open. I'd
like to talk to you (perhaps over lunch) about your perceptions
of what happened here. Mine is that I had an impossible task, and
did it. Under time, under budget, and understaffed. I'm still kind
of hurt and confused, but functioning quite well.
eric
-------
∂01-Jun-85 0918 CLT
i think we should leave for Beeson's around 2:30 or 2:45
∂01-Jun-85 1110 JJW PUB from PARC
To: ME@SU-AI.ARPA, JMC@SU-AI.ARPA, LB@SU-AI.ARPA
I took a quick look at the PUB stuff left by JLJ on [KA,SYS]. It looks like
he made some progress, but left before the conversion was finished. It
might take 40-100 hours for someone fairly familiar with the SAIL language
to finish it. (Rudimentary knowledge of WAITS and TENEX would also be
useful.) If you're thinking of hiring someone for it, there's an obvious
candidate: REM.
∂01-Jun-85 1119 RPG Soft Drinks
I'm talking about generally available European soft drinks. Typically
they seemed to be recipes based on a strong lemon-flavor base. Particularly
Fanta orange soda comes to mind. Typically the names of this in the various
countries would mention both orange and lemon. These, and others like them,
struck me as much less sweet than Coke or their US equivalents. The Coke
seemed to taste the same to me.
I should also note that some of the soft drinks had what appeared to be
some pulp in them, even the Fanta stuff.
-rpg-
∂01-Jun-85 1706 ME Prancing Pony Bill
Prancing Pony bill of JMC John McCarthy 1 June 1985
Current Charges 5.10 (vending machine)
-------
TOTAL AMOUNT DUE 5.10
Please deliver payments to Rutie Adler, room 358, Jacks Hall.
Make checks payable to: STANFORD UNIVERSITY.
To ensure proper crediting, please include your Pony account name on your check.
Bills are payable upon presentation. Interest of 1.5% per month will be
charged on balances remaining unpaid 25 days after bill date above.
∂01-Jun-85 2119 VAL situation calculus
Some other interesting things we can do with my axioms for names. What if
some objects come into being or disappear in the course of events?
Introduce a function snapshot(x,s), and define exists(x,s) (i.e., "x exists
in situation s") as abbreviation for exists snapshot(x,s). Then we can say,
for instance, that event e creates x in situation s if exists(x,result(e,s))
but not exists(x,s). Or we can use this axiom in the missionaries and cannibals
problem:
possible(eat(c,m),s) -> not exists(m, result(eat(c,m),s)).
Or we can describe the process of creating one volume of liquid out of two
by saying that the snapshots of these volumes had different denotations in
a situation, but then became equal as a result of a certain action.
∂02-Jun-85 0726 VAL re: situation calculus
[In reply to message rcvd 01-Jun-85 21:40-PT.]
It seems that your bad solution for M&C is ruled out by my axiom for eating
if we declare the goal to be a situation with three missionaries and
three cannibals on the other bank. If the missionaries have been eaten
then they aren't there, they simply don't exist.
∂02-Jun-85 1336 ASHOK@SU-SUSHI.ARPA Faculty candidate
Received: from SU-SUSHI.ARPA by SU-AI.ARPA with TCP; 2 Jun 85 13:36:13 PDT
Date: Sun 2 Jun 85 13:18:17-PDT
From: Ashok Subramanian <ashok@SU-SUSHI.ARPA>
Subject: Faculty candidate
To: jmc@SU-AI.ARPA, yao@SU-SCORE.ARPA, nilsson@SU-SCORE.ARPA
cc: ashok@SU-SUSHI.ARPA
Umesh Vazirani would like to visit us in late July. I would like to
know if you plan to be around during that period, so we can schedule
his visit accordingly.
ashok
-------
∂03-Jun-85 0855 ROSENBLOOM@SUMEX-AIM.ARPA Re: qual schedule
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 3 Jun 85 08:55:44 PDT
Date: Mon 3 Jun 85 08:55:34-PDT
From: Paul Rosenbloom <ROSENBLOOM@SUMEX-AIM.ARPA>
Subject: Re: qual schedule
To: GENESERETH@SUMEX-AIM.ARPA
cc: TOB@SU-AI.ARPA, Buchanan@SUMEX-AIM.ARPA, Feigenbaum@SUMEX-AIM.ARPA,
JMC@SU-AI.ARPA, Nilsson@SU-SCORE.ARPA, tw@SU-AI.ARPA
In-Reply-To: Message from "Michael Genesereth <GENESERETH@SUMEX-AIM.ARPA>" of Sun 26 May 85 16:41:47-PDT
Mike: It turns out that the potential conflict that I mentioned in my
message about scheduling the quals on Thursday June 13 does in fact
exist. The psychology equivalent to black friday is that day -- all
day. I have managed to avoid these serious interdepartmental
conflicts most of the year, but this is a bad one. Considering that
they don't take kindly to faculty not being there, and the constant
(but usually unstated) question as to whether I really belong (and am
committed) to that department, I really should not miss it. Likewise
with the AI quals.
Is there any chance that the quals can be held on Friday. If not, do
I need to be there the whole morning, or will I only be scheduled for
a couple of the sessions? If the latter is the case I might be able
to shuttle back and forth between the two during the morning (I am
checking with psychology to see whether it would be feasible to
shuttle in and out of that meeting as well). -- Paul
-------
∂03-Jun-85 0904 CLT
how about no supper tonight -- maybe late coffee?
∂03-Jun-85 1037 JF@SU-SUSHI.ARPA june money due
Received: from SU-SUSHI.ARPA by SU-AI.ARPA with TCP; 3 Jun 85 10:37:19 PDT
Date: Mon 3 Jun 85 10:34:11-PDT
From: Joan Feigenbaum <JF@SU-SUSHI.ARPA>
Subject: june money due
To: coffee-drinkers: ;
This is a reminder that coffeepool money for june is due. Please pay up
or the good coffee and tea will disappear from the kitchen as quickly and
easily as it appeared. Suggested for frequent coffee drinkers is $5 per
month and for frequent tea drinkers $2 per month. Of course, pay less if
you think you drink less frequently. Give me the money in person, leave it
in my mail folder, or slip it under the door of mjh 325. Apologies if you've
already paid.
Joan Feigenbaum
-------
∂03-Jun-85 1034 VAL Circumscription Seminar
To: "@CS.DST[1,VAL]"@SU-AI.ARPA
Next meeting:
Speaker: John McCarthy
Topic: "More Applications to AI", Part II
Time: Wednesday, June 5, 2pm
Place: MJH 301
∂03-Jun-85 1321 PETTY@RUTGERS.ARPA 85-mailing
Received: from RUTGERS.ARPA by SU-AI.ARPA with TCP; 3 Jun 85 13:21:11 PDT
Date: 3 Jun 85 16:17:36 EDT
From: PETTY@RUTGERS.ARPA
Subject: 85-mailing
To: arpanet.mail: ;
cc: pettY@RUTGERS.ARPA, loungO@RUTGERS.ARPA
Below is a list of our newest technical reports.
The abstracts for these are available for access via FTP with user account
<anonymous> with any password. The file name is:
<library>tecrpts-online.doc
If you wish to order copies of any of these reports please send mail via the
ARPANET to PETTY@RUTGERS or LOUNGO@RUTGERS. Thank you!!
[ ] LCSR-TR-67 "EXTENDING AUTHORIZATION BY ADDING OBLIGATIONS TO
PERMISSIONS", N. Minsky, A. Lockman.
[ ] LCSR-TR-68 "UNIFYING THE USE AND EVOLUTION OF DATABASE SYSTEMS: A
CASE STUDY IN PROLOG", N. Minsky, D. Rozenshtein,
J. Chomicki.
[ ] LCSR-TR-69 "A LOWER BOUND TO THE COMPLEXITY OF EUCLIDEAN AND
RECTILINEAR MATCHING ALGORITHMS", M.D. Grigoriadis,
B. Kalantari.
[ ] LCSR-TR-70 "LANGUAGE FEATURES FOR FLEXIBLE HANDLING OF EXCEPTIONS IN
INFORMATION SYSTEMS", A. Borgida.
[ ] DCS-TR-151 "THE MATHEMATICS OF ENERGY PROPAGATION IN NUMERICAL
APPROXIMATIONS OF HYPERBOLIC EQUATIONS", R. Vichnevetsky.
[ ] DCS-TR-152 "TENSOR FORM OF NUMERICAL DIFFUSION IN MULTI-DIMENSIONAL
FLOW COMPUTATIONS", R. Vichnevetsky, V. Venkatakrishnan.
[ ] DCS-TR-153 "CK-LOG, A CALCULUS FOR KNOWLEDGE PROCESSING IN LOGIC",
C. Srinivasan.
[ ] DCS-TR-155 "INTEGRITY CHECKING FOR MULTIPLE UPDATES", A. Hsu,
T. Imielinski.
[ ] DCS-TR-156 "PIECEWISE-POLYNOMIAL QUADRATURES FOR CAUCHY SINGULAR
INTEGRALS", A. Gerasoulis.
[ ] DCS-TR-157 "COMMUNICATION DENIAL IN CSP", R.M. Nemes.
[ ] CTA-TR-7 "SOME RESULTS ON THE PEBBLE COMPLEXITY OF SETS OF STRINGS",
A. Yasuhara.
-------
∂03-Jun-85 1919 PARK@SRI-AI.ARPA SciFi Costume Ball
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 3 Jun 85 19:19:16 PDT
Date: Mon 3 Jun 85 17:55:14-PDT
From: Bill Park <PARK@SRI-AI.ARPA>
Subject: SciFi Costume Ball
To: PARTY-PEOPLE: ;
NON-ELECTRONIC IMAGERY EVENING
| | |O<--Bill Park's house (3rd on right) | SATURDAY
| | |O 1430 Mills Court, Menlo Park | JUNE 8
| + |O (415) 326-6369 | 6:00 PM
E |--|--+---+-------------------------------------| M
l | | |M |L Glenwood Ave | i
| +S |i |a | d
C | |P |l |u | d
a | + |l |r | l
m | | |s |e | e
i | + | |l Oak Grove Ave | f
n |--|--+---+-------------------------------------| i
o | +t |S | e
| |r |t | l
R | +a |r | d
e | |c |e |
a | +k |e | R
l | |s |t Ravenswood Ave | d
|--|------+-------------------------------------|
| | | ** SRI ** |
Bring your favorite potable potation and view slides of the BayCon
Science Fiction Convention Costume Ball, held recently at the Red
Lion Inn in San Jose. If they're not back from the drugstore by
then, I'll show the infamous Last San Francisco Hooker's Ball slides
instead (rated X). Maybe I'll show those anyway.
If you have a particularly notable slide you would like to inflict
on the other guests, bring it along too.
-------
∂03-Jun-85 1954 RESTIVO@SU-SCORE.ARPA Monadic program
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 3 Jun 85 19:54:38 PDT
Date: Mon 3 Jun 85 19:55:24-PDT
From: Chuck Restivo <RESTIVO@SU-SCORE.ARPA>
Subject: Monadic program
To: JMC@SU-AI.ARPA
cc: Restivo@SU-SCORE.ARPA
[cwr] if anything that follows seems misguided or just plain
wrong I would appreciate your comments and criticisms
before I get going. thanks
⊗The five step algorithm represents a decision method.
Input will most probably be a predicate formula.
Output will be something on the order of y/n.
Sample inputs:
|
A,...,A - | B ! A is an axiom or formula
n |
←
(A,/\.../\,A) ) B
-
Sample outputs:
yes, it is a universal theorem or no it is not.
yes, it is universally valid.
Example inputs:
Church; exercise 34.0 and 46.2 If there is something
specific that you had in mind I would love to hear about
it.
E and F are arbitrary atomic formulas.
I assume interpretation to be the sort of interpretation
defined in Chang and Lee's text. I had to come to grips
with this. The generalized case offered by C+L seems to
be appropriate.
R ... (W ) is an atomic formula.
e1 en k
Language definition:
equality will not be supported.
connectives /\, \/, --, = , existence, implies (in terms of
| -
disjunctives) will be supported.
variables u,v,x , y will be supported.
1 25
constants a,b,[ ], 5 will not be supported.
predicates =, prime, epsilon, >= will not be supported.
functions such as gcd, append, + will not be supported.
we will have on ary predicates.
which function symbols, if any?
what is the arity of the function symbols if any?
then --> ( ) implies not will be supported
quantifiers there-exists and there-exists-forall will be
supported.
connectives and, or, not will be supported. It seems in the paper
as though only there-exists is being used)
is the 'iff' used to define P (W) a meta construct or
1
does it mean 'iff'?
do we want to deal with structures? This isn't clear
at least to me.
would you venture a guess at what the largest n that may interest
you might be?
btw: I obtained a copy of the Liskov/Hubberman thesis. Have
been going through the work. I would pay to work on a
problem like this.
-------
∂04-Jun-85 0643 RA sick
To: BS@SU-AI.ARPA, JMC@SU-AI.ARPA, pierce@SU-SCORE.ARPA
I came back from my vacation with a problem which reuqired a surgical
procedure;; I am ok now but will need a day or two to recover. I will
be back at work either Wednesday or Thursday. If I can't come in tomorrow,
I will let you know.
See you soon,
Rutie
-----
∂04-Jun-85 0945 NILSSON@SU-SCORE.ARPA AI Retreat
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 4 Jun 85 09:45:17 PDT
Date: Tue 4 Jun 85 09:45:07-PDT
From: Nils Nilsson <NILSSON@SU-SCORE.ARPA>
Subject: AI Retreat
To: Feigenbaum@SUMEX-AIM.ARPA, Genesereth@SUMEX-AIM.ARPA, TW@SU-AI.ARPA,
JMC@SU-AI.ARPA, Rosenbloom@SUMEX-AIM.ARPA, Buchanan@SUMEX-AIM.ARPA,
TOB@SU-AI.ARPA, Shortliffe@SUMEX-AIM.ARPA
cc: nilsson@SU-SCORE.ARPA
I've talked with some of you about having an AI retreat to talk about
various matters that concern us all jointly as AI faculty (prospective
new faculty, prospects for research collaboration, curriculum, etc.).
There was some early talk about spending the weekend of July 13-14 at
EAF's Tomales Bay house, but at least one of us cannot make it on that
date. Also some preferred a site not so far away and thought that we
could accomplish in one day (preferably a week day) most of what we want
to accomplish. It would be useful to get away from our MJH, Welch,
Cedar, etc. phones. Also, we ought to get sufficiently far away from
Stanford to disrupt any possibilities for "ducking out" of the retreat
for "an hour or so" to attend some important meeting. We can probably find
some nice site within an hour's drive. How about one of the following
dates? Thursday, June 27; Wed, July 10; Thurs, July 11; or Fri, July 12.
-Nils
-------
∂04-Jun-85 0945 TULEY@SU-SCORE.ARPA message
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 4 Jun 85 09:45:38 PDT
Date: Tue 4 Jun 85 09:46:22-PDT
From: Kimberly Tuley <TULEY@SU-SCORE.ARPA>
Subject: message
To: jmc@SU-AI.ARPA
Hello,
David Laning, of SRI, would like you to call him. 859-2871
Kim
-------
∂04-Jun-85 1351 TULEY@SU-SCORE.ARPA msg
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 4 Jun 85 13:51:45 PDT
Date: Tue 4 Jun 85 13:27:59-PDT
From: Kimberly Tuley <TULEY@SU-SCORE.ARPA>
Subject: msg
To: jmc@SU-AI.ARPA
Hello,
Michael Levitt, of Systems Concept, would like you to call.
415-442-1500.
Kim
-------
∂04-Jun-85 1506 SJG house initialization
To: "@PARTY.DIS[1,SJG]"@SU-AI.ARPA
Hi guys:
I'm having a housewarming/poolwarming/barbecue/whatever get-together
this Saturday, if there's interest. The plan is for swimming and such
starting around three, a barbecue and then charades when it gets dark.
Please let me know if you're coming; bring something to eat ...
See you Saturday!
Matt
p.s. Address is 3233 Bryant Street. It's a block and a half south of
Loma Verde.
∂04-Jun-85 1515 TULEY@SU-SCORE.ARPA
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 4 Jun 85 15:13:52 PDT
Date: Tue 4 Jun 85 15:14:22-PDT
From: Kimberly Tuley <TULEY@SU-SCORE.ARPA>
To: mccarthy@SU-SCORE.ARPA
Thelma from Inference Corp called in regards to changing the board meeting
Call her at 213 417-7997
-------
∂04-Jun-85 1620 TULEY@SU-SCORE.ARPA msg
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 4 Jun 85 16:15:38 PDT
Date: Tue 4 Jun 85 16:11:40-PDT
From: Kimberly Tuley <TULEY@SU-SCORE.ARPA>
Subject: msg
To: jmc@SU-AI.ARPA
Michael Levitt, of Systems Concepts, called you one more time.
442-1500.
Kim
-------
∂04-Jun-85 1630 TULEY@SU-SCORE.ARPA msg
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 4 Jun 85 16:30:06 PDT
Date: Tue 4 Jun 85 16:30:38-PDT
From: Kimberly Tuley <TULEY@SU-SCORE.ARPA>
Subject: msg
To: jmc@SU-AI.ARPA
Peter Michelson, of Physics, would like you to call him. 7-4308
Kim
-------
∂04-Jun-85 2039 @SU-SCORE.ARPA:bellcore!walker@Berkeley for your information: copy of a proposal intended to justify
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 4 Jun 85 20:39:19 PDT
Received: from UCB-VAX.ARPA by SU-SCORE.ARPA with TCP; Tue 4 Jun 85 20:39:18-PDT
Received: by UCB-VAX.ARPA (4.24/4.46)
id AA25537; Tue, 4 Jun 85 19:52:11 pdt
Received: by mouton.UUCP (4.12/4.7)
id AA25556; Mon, 3 Jun 85 17:46:14 edt
Date: Mon, 3 Jun 85 17:46:14 edt
From: bellcore!walker@Berkeley (Don Walker)
Message-Id: <8506032146.AA25556@mouton.UUCP>
To: aaai-office@sumex.ARPA, bates@bbng.ARPA, feinler@sri-nic.ARPA,
genesereth@su-score.ARPA, mann@isib.ARPA, mccarthy@su-score.ARPA
Subject: for your information: copy of a proposal intended to justify
Cc: ~/msg@Berkeley
connecting Bellcore to the ARPANET; you are referenced in one way or
another in it, so it seemed appropriate to inform you in advance in
case Leiner or someone else contacts you. Actually, it might be
appropriate for Lyn and Bill, in particular, to let me know who they
interact with at DARPA. Barry Leiner is responsible for ARPANET
connections but not for research that is outside his programs, which
our lexicon work certainly is. Any guidance you can give us would
be appreciated. While I would have preferred to send this material
to you prior to sending it to Leiner, the time getting things done
here made it desirable to do things in parallel.
Don
To: Barry←Leiner
From: Michael←Lesk
Subject: Grant Proposal
Bell Communications Research (hereafter Bellcore) proposes to undertake
research in the areas of computational linguistics and network
monitoring, and requests support from the Defense Advanced Research
Projects Agency. The form of support we request is permission to be
connected to the ARPANET. Bellcore will assume the costs of access
lines and modems as well as the costs of the research itself. These
projects are being carried out in cooperation with members of the DARPA
research community, and connection to the ARPANET will accelerate our
work on them as well as furthering the research efforts of other DARPA
contractors. The results of our research will be made available to the
entire DARPA research community over the ARPANET. Three of the projects
we are undertaking that seem most relevant are described in the
following sections.
1. Knowledge Resource Tools
Bellcore is engaged in a major program of research that brings
together approaches from artificial intelligence, computational
linguistics, and information science. The focus is the development of
what we call "knowledge resource tools" for accessing massive text
files. A key element in our approach is the use of lexical
information. We have made major use of machine-readable dictionaries
in our work, but it has always been obvious that existing dictionaries
are not adequate for current work in natural language processing.
Consequently, we are exploiting the interaction between dictionaries
and documents: using information from the dictionaries to identify
relevant features of the text, and feeding back the results to refine
the dictionary entries. A major problem with dictionaries is their
failure to include people, places, institutions, and events--key
elements in understanding most, if not all, documents. Another
difficulty is that they do not deal effectively with sequences of words
that constitute single semantic elements. Consequently, we have been
particularly interested in developing techniques to identify these
features in text for inclusion in more powerful dictionaries. Working
with multimillion-word text corpuses proves to be a key element.
Enriching the syntactic and semantic content of the dictionary in ways
that will be useful to current research on language understanding poses
other problems, ones that will require support from other research
groups.
Over the last several years we have been interacting extensively with
the computational linguistics community in examining machine-readable
dictionaries and trying to clarify the role of the lexicon. This has
led us to organize several workshops. The latest on "The Lexicon,
Parsing, and Semantic Interpretation" (held at CUNY this past January)
seems likely to precipitate a community-wide effort to share
information and work toward shareable lexical features. The presence
of the headquarters of the Association for Computational Linguistics at
Bellcore supports the centrality of our role in this activity. We have
had discussions with BBN, ISI, CMU, Xerox PARC, Thinking Machines
Corporation, and MCC (in which Bellcore is a shareholder), among DARPA
contractors and ARPANET members.
We have just begun work with MCC directed toward the development of a
comprehensive lexical resource that can be systematically extended
through community participation. (Robert Amsler at Bellcore and
Jonathan Slocum at MCC are the major protagonists in this effort.)
Prompted by the increasing difficulties in gaining access to published
dictionaries, resulting from the recent recognition of their commercial
value, we have begun to create one ourselves, deriving the initial
vocabulary from words in actual use (specifically from an 8 million
word corpus of the New York Times). This lexicon will contain 50,000
entries and include grammatical categories and inflections as a first
stage. Extensions depend critically on interactions among the
community members. We do not mean to slight the problems likely to be
encountered in working toward a consensus, but it is clear that this
approach could contribute to and benefit from activities like the
DARPA-motivated coordination between BBN and ISI which is intended to
produce a common lexicon for parsing and generation.
It is appropriate to add that our work fits in more generally with a
number of projects in natural language processing funded out of IPTO
and in particular with the following objectives of the Strategic
Computing Initiative program statement: "develop techniques for
interactive acquisition of linguistic knowledge"; "develop methods for
assimilating text information into pre-existing knowledge structures
and for explaining text interpretations"; "develop programs which can
effect substantial reorganization of existing knowledge structure on
the basis of text"; and "develop new techniques for content-based
information retrieval and the discovery of generalizations based on
meaning gleaned from massive amounts of text." We believe that our
work will make substantive contributions to all of these problems.
Among DARPA contractors, we believe that it would be particularly
appropriate to contact Madeleine Bates at BBN and William Mann at
ISI for a reaction to this part of the proposal.
2. Capturing the Literature on Artificial Intelligence
A second project derives from our work on Knowledge Resource Tools.
In conjunction with the DARPA Network Information Center, the
American Association for Artificial Intelligence, and John McCarthy
and Michael Genesereth at Stanford University, we have been planning
facilities and procedures for storing and accessing the literature on
artificial intelligence. There are actually two related efforts:
The first is to identify the literature in the form of bibliographic
citations and work toward a more comprehensive system for bibliographic
retrieval. The second would create an electronic library of the
literature, including increasingly larger numbers of papers and
books in the field. In addition to its critical importance for
DARPA, this activity could become a model for information retrieval
of the future. AI is a field in which most of the items in the
literature are created online. Consequently, it will be easier to
move toward comprehensiveness, although we do not mean to minimize
the problems likely to be encountered on the way.
An initial goal in this activity is the determination of the vocabulary
used in artificial intelligence and the establishment of a more effective
way of categorizing documents. We have available to us for research
purposes the three volume Handbook of Artificial Intelligence edited
by Avron Barr, Edward Feigenbaum, and Paul Cohen. While clearly out
of date, it constitutes a good starting point for this effort. Working
closely with universities on the ARPANET, we can gain access to a
wide range of papers and dissertations in the field. Again, our
role in the Association for Computational Linguistics makes its
journal, Computational Linguistics, available to us. We also have
the Secretary-Treasurer of the International Joint Conferences on
Artificial Intelligence resident and thus have access in principal
to their proceedings. The AAAI Magazine and conferences constitute
another source. Bellcore is prepared to support this effort with a
major commitment of resources. However, it is clear that the ability
to FTP documents is essential for this work.
For reactions to this part of the proposal it would be appropriate
to contact Jake Feinler at the Network Information Center, Claudia
Mazzetti at AAAI, and John McCarthy and Michael Genesereth at Stanford.
3. Network Monitoring and Maintenance
Bellcore has a large (and growing) IP internet having over 100 hosts
and 18 packet networks spread across 4 locations. We use this
network for research and operational purposes (e.g., mail, database
access, etc.) and we expect in the future far larger
commercial internets, stimulating great interest in network
monitoring and maintenance. An outgrowth of earlier work into monitors
for individual packet networks, we are currently developing the
capability to monitor the status of an internet by deploying dedicated
monitors into key networks. These monitors form the "ears" of a
distributed network monitoring system. The data from these monitors
travel across the internet to a central point, where they are
collected and analyzed. With the development of several specific monitors
completed, our current focus is on the mechanisms to control and
maintain these unattended machines exclusively from a remote access
point.
This system will initially serve two purposes. First, statistics on a
cross section of networks will be collected, thus forming a
"statistics scrapbook" of sorts for packet networks. Second, the
distributed nature of the system will allow statistics to be collected
on internet interactions and operations. We hope that the resulting
data will further research into future internet, ipc, and network
interface designs. We also expect this system will evolve to form the
basis of a network management system. By using the monitors as
remotely controlled "probes", the system can be used for network fault
isolation and recovery.
Bellcore's needs in this area of research obviously mirror those of the
ARPANET community, given its far larger internetwork and wide dispersal
of administrative control. In addition to improved communications
with other DARPA researchers, an ARPANET connection would open the
possibility of deploying our monitors into other ARPA-Internet sites,
thus widening the set of networks to be studied. This would allow us
to have a set of monitors "traveling" around the country to
participating sites, collecting data while being controlled remotely.
We have had discussions along these lines with Paul Amer at the
University of Delaware/NBS, who is currently pursuing network
monitoring research for the Office of Naval Research.
The three preceding projects are only examples of areas in which
research at Bellcore done in conjunction with DARPA contractors could
prove to be valuable to the DARPA community. Three others, which we
could elaborate if appropriate, relate to browsing systems, speech
understanding, and packet radio networks. Browsing systems are information
retrieval systems configured so that a user can quickly scan large
numbers of interlinked items, thus navigating an information space.
We are exploring the use of wideband networks both to download megabytes
of information and for handling multimedia data elements. There are
possibilities for cooperative research with Xerox PARC, MIT, MCC,
and other university sites. Work on speech analysis, synthesis, and
understanding is taking place in a number of groups at Bellcore. We
are anxious to collaborate with DARPA contractors as their programs
in this area take form. Raj Reddy at CMU has indicated a particular
interest in that possibility. A Bellcore researcher having close ties with
the amateur radio and amateur satellite communities is actively pursuing
research in packet radio networks. We are also connected with the
STARNET project for satellite bulletin board distribution. Dave Mills
of Linkabit has expressed interest in joint experiments, and Dave Gifford
at MIT is also working in this area.
It is clear that Bellcore has a number of activities that could justify
an ARPANET connection. We would appreciate your reactions to this
proposal and any recommendations you might have for sharpening it so
that it will prove more effective in justifying our request.
∂05-Jun-85 0011 JJW Ideas on my thesis
To: JMC@SU-AI.ARPA, RPG@SU-AI.ARPA, ullman@SU-AIMVAX.ARPA
Here's a summary of some of my recent thoughts on parallel Lisp, and
proposals for what to do next. This is a rather long message, so I hope
you have the time to read it.
Two distinguishing characteristics of existing proposals for parallel
Lisps are the language constructs and the target architectures. I do
not propose to introduce new ideas in either of these areas, though for
convenience I'd like to abstract the existing forms into whatever turns
out to be most useful.
As a basis for language constructs, I'm considering those of Qlambda and
Multilisp.
The main abstraction for language features is what I'll call "conditional
futures". Futures are representations of values being computed by
separate processes. They can be passed around just like other data
objects (in the Lisp style of passing pointers), but if a process performs
an operation that requires the value being computed, it will suspend if
that value is not yet available and automatically resume when it is.
Once the value of a future has been computed, a distinction need no longer
be made between the future and the value it represents. Thus, futures are
semantically equivalent to their values; the only difference is
operational, in that futures have the potential of speeding up computation
which does not immediately need to reference the value, but there is also
an associated overhead cost for using futures.
A conditional future consists of a predicate, and a form that computes a
value. If the predicate is true, the result is a future with a new task
spawned to compute the value. If false, the process evaluating the
conditional future itself computes the value, avoiding the overhead.
Neither Qlambda nor Multilisp directly provides conditional futures. In
Qlambda, the conditional predicates are explicit in the QLET and QLAMBDA
forms, but the futures are implicit. Multilisp has explicit futures, but
only unconditional.
Neither of these obstacles is at all important. In Qlambda, we can create
an unconditional future to compute an expression E by writing
(QLET 'EAGER ((X E)) X)
and a future conditional on P to compute E by writing
(QLET (IF P 'EAGER NIL) ((X E)) X)
In Multilisp, the unconditional future is (FUTURE E), and the conditional
future is
(IF P (FUTURE E) E)
I don't want to waste time arguing whether Qlambda or Multilisp has a better
syntax for expressing conditional futures. Obviously in either language one
could define a macro (CFUTURE P E) that would have the desired effect. The
Qlambda primitives and the Multilisp primitives can also be defined in terms
of each other with no runtime performance penalty.
The next question is whether futures are a sufficient basis with which to
do parallel computation. In an applicative language, I claim this is so.
(I will argue for applicative computation in a moment.) To prove this
claim, I will have to show that the introduction of futures into an
applicative program always leads to a computation that takes a minimum
time given enough processors, or can attain the minimum possible on fewer
processors. If the cost (overhead) of futures is zero, this seems fairly
clear to me, though I haven't proved it yet.
(All of this assumes no change in the algorithm itself. The introduction
of parallel algorithms can of course provide even more speedup, but that
sort of high-level decision is left to the programmer. It will be
important to show that applicative Lisp with futures is a good language
for expressing parallel algorithms.)
When there is a non-zero cost for creating futures, then there are some
computations that run faster when less than full parallelism is used.
The trick, then, is to use conditional futures with predicates chosen to
optimize the running time.
That is basically what I want to do. The open question is what, among the
wide range of possibilities, should be used for the conditions. Some
general classes of conditions are: (1) extra variables introduced into the
program, such as the "depth" in the Fibonacci example in the Qlambda
paper; (2) extra information stored in the data, such as the "size" of the
data used in a subcomputation, or some other estimate of the time needed
for the subproblem; (3) information about the current state of the
multiprocessor, to avoid creating more parallelism when there is enough to
keep all processors busy. There must be other possibilities as well.
I am hoping to find some general principles that will guide programmers to
the proper choice of these conditions, or even better, that will enable
compilers and interpreters to choose them automatically. To look for
these general principles, I will need to try test cases, see what works
and what doesn't, and find out why. I don't think I can come up with the
answers in any other way, and at this time I'm about ready to start the
experiments.
Some sort of simulation of the multiprocessor Lisp environment is needed,
since at present we don't have a running multiprocessor Lisp. I would
like to avoid starting from scratch, and there are two existing tools that
could be used. One is the Qlambda simulator written by RPG for the
Symbolics Lisp Machine. The other is the Multilisp simulator written by
Halstead for the VAX.
I don't yet have enough experience with either of these to say which is
better, both in terms of the statistics-gathering facilities available and
speed of execution. If there's a clear winner, I'll use it. There is
also the possibility of running the Multilisp simulator on the S-1 at
Livermore, since it has Unix. (In theory the Qlambda simulator should be
easy to adapt to S-1 Lisp, but no one has yet brought up S-1 Lisp running
under an operating system there.)
My intention is to parameterize the simulation to allow studying the
effects of different costs for the creation of futures and other primitive
operations. If these variables have a direct and simple effect on the
choice of predicates for conditional futures, there's a useful result.
Both of these simulators are geared towards standard von Neumann
processors with a shared global memory. Other architectures for
multiprocessors allow greater expansion before performance starts to
degrade, and these should be investigated. I think the simulators are
flexible enough so that this is fairly simple. The dataflow model of
computation is also very suitable for futures, and will be considered.
Above, I promised to argue in favor of applicative programming. The
use of side effects in conjunction with parallelism is known to make
writing and debugging programs difficult. Applicative programs have a
clean semantics and are equivalent in their sequential and parallel
implementations. Thus, there is a lot to be said for not using side
effects.
On the minus side, it is sometimes hard to express algorithms efficiently
in a purely applicative language, especially when one uses high-order
abstractions like mapping functions and combinators. But this can often
be solved by using "lazy evaluation", which avoids performing parts of
the computation that are not needed for the result.
It may be going a bit far to say that applicative programming with lazy
evaluation is both expressive and efficient enough for all general
programming tasks. But I think a large class of problems do fall into
this category, and for these it is worth the effort to use this style.
On a parallel processor, though, one may not want to adhere to lazy
evaluation all the time. There is potential gain in computing a
subexpression's value by the time it is needed, although there is a
potential loss in computing it if it is never used. (And there is the
danger of running on forever if the program uses the "infinite data
structures" that lazy evaluation allows.)
This leads to an extension of the concept of conditional futures. As
well as deciding whether to compute a subexpression in a separate
process, we can give it a priority (or assign it a fraction of the
available processing power), thus placing it on a continuum between
strict lazy evaluation and full eager evaluation. The assignment of
these priorities is another question that can be studied in experiments.
Summary:
Here are the things that I propose to do.
1. Show that futures are a sufficient construct to express parallel
execution of applicative programs, and that Lisp with futures is a
good language in which to express parallel algorithms.
2. Experiment with various predicates for conditional futures, to see
what performs best using a variety of assumptions about the parallel
architecture.
3. Experiment with priorities for lazy evaluation in conjunction with
conditional futures.
4. Systematize the results, if possible, into guidelines that can be
applied in writing parallel Lisp programs, and in automating the
introduction of these predicates into programs.
∂05-Jun-85 1050 ullman@diablo Re: Ideas on my thesis
Received: from SU-AIMVAX.ARPA by SU-AI.ARPA with TCP; 5 Jun 85 10:49:56 PDT
Date: Wed, 5 Jun 85 09:13:12 pdt
From: Jeff Ullman <ullman@diablo>
Subject: Re: Ideas on my thesis
To: JJW@Sail, JMC@Sail, RPG@Sail
1. I'm reminded of a remark Dave Cheriton made a while ago:
If the task you consider spawning takes much more time than
the spawning overhead, then you may as well spawn it, whether
or not a processor is available, because it only slows you
down 10% (say). If the task takes time comparable to or less
than the spawning overhead, then there is never a win in spawning
it. The point is that size estimation is the key; processor
availability is (almost) irrelevant.
2. As you know, I worry about the assumption of a single process
queue. That may be fine for an S-1 or an ultracomputer, but
it is hardly valid for a grid of transputers or a cosmic cube, e.g.
In particular, try writing the O(log↑2n) parallel transitive
closure algorithm in Qlambda or Multilisp.
If you can't, then you are going to have trouble with claims
of general results about optimal parallelism.
---Jeff Ullman
∂05-Jun-85 1056 NILSSON@SU-SCORE.ARPA AI Retreat Reconsidered
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 5 Jun 85 10:56:01 PDT
Date: Wed 5 Jun 85 09:24:37-PDT
From: Nils Nilsson <NILSSON@SU-SCORE.ARPA>
Subject: AI Retreat Reconsidered
To: Feigenbaum@SUMEX-AIM.ARPA, Genesereth@SUMEX-AIM.ARPA, TW@SU-AI.ARPA,
JMC@SU-AI.ARPA, Rosenbloom@SUMEX-AIM.ARPA, Buchanan@SUMEX-AIM.ARPA,
TOB@SU-AI.ARPA, Shortliffe@SUMEX-AIM.ARPA
cc: nilsson@SU-SCORE.ARPA
Well, Performing a set intersection on peoples' available dates so
far yields NIL. I think it's more important for all of us to be there
than to hurry, so let's consider some later dates. How about one
day during the weeks of: Tue-Fri July 30 - Aug 2; Mon-Fri Aug 5-9;
Tue-Fri Sept 3-6 ?? -Nils
-------
∂05-Jun-85 1157 RA Ellis Kroptechev film
Florin Fabricy from KQED called re permission to use the above. His
tel. (55) 751 8888. He'll send a release form.
∂05-Jun-85 1238 RA IJCAI 85
On my desk I found an envelop with the registration form filled out; I need
a check for $175.00.
Thanks.
∂05-Jun-85 1333 EMMA@SU-CSLI.ARPA Re: two questions
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 5 Jun 85 13:32:47 PDT
Date: Wed 5 Jun 85 13:29:52-PDT
From: Emma Pease <Emma@SU-CSLI.ARPA>
Subject: Re: two questions
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Wed 5 Jun 85 13:29:00-PDT
Tel: 497-3479
I have forwarded the questions to 1) Accounts and 2) Ingrid@csli.
You should be receiving answers shortly.
-Emma
-------
∂05-Jun-85 1412 SAMI@SU-CSLI.ARPA Turing Account
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 5 Jun 85 14:12:00 PDT
Date: Wed 5 Jun 85 14:08:16-PDT
From: Sami Shaio <SAMI@SU-CSLI.ARPA>
Subject: Turing Account
To: jmc@SU-CSLI.ARPA
cc: accounts@SU-CSLI.ARPA
Your account <JMC> still exists on Turing. We had a disk crash a
while ago that resulted in the loss of all the passwords. I set your
password to 999. Please change it as soon as you can. If you want your
account changed from <JMC> to <MCCARTHY> just send mail to accounts@su-csli.
--sami
-------
∂05-Jun-85 1410 RA Alaska
Tokyo-Anchorage (via Seattle, executive class)-SF (coach) will add
$303.00 to your ticket; if you want to go first class from Anchorage
to SF, it will add $429 to the price. If you want me to make the change,
let me know and I will call Northwest Orient. Do you need a hotel in
Anchorage?
∂05-Jun-85 1421 RA IJCAI
You need to pay the $175 registration fee.
∂05-Jun-85 1430 ucscc!beeson%ucscd.ucscc.UUCP@Berkeley talk about my paper?
Received: from UCB-VAX.ARPA by SU-AI.ARPA with TCP; 5 Jun 85 14:29:50 PDT
Received: by UCB-VAX.ARPA (4.24/4.46)
id AA15986; Wed, 5 Jun 85 14:27:05 pdt
Received: from ucscd.UCSC (ucscd.ARPA) by ucscc.UCSC (4.12/4.7)
id AA05685; Wed, 5 Jun 85 12:01:24 pdt
Received: by ucscd.UCSC (4.12/4.7)
id AA01394; Wed, 5 Jun 85 12:00:45 pdt
Date: Wed, 5 Jun 85 12:00:45 pdt
From: ucscc!beeson%ucscd.ucscc.UUCP@Berkeley (20012000)
Message-Id: <8506051900.AA01394@ucscd.UCSC>
To: su-ai.jmc@Berkeley
Subject: talk about my paper?
Cc: beeson%ucscd.ucscc.UUCP@Berkeley
You said I should come to Stanford to discuss it with
you, Carolyn, and Vladimir. I would like to do that
sometime next week if possible and certainly before the
middle of June if possible. Any day in that period is
fine with me, and any time after 10 am.
∂05-Jun-85 1426 RA Alaska
Going from Tokyo to Anchorage (via Seattle, executive) and then to SF
(coach) will add $303.00 to the price of the ticket. If you want to
go Anchorage-SF first class the addition will be $429. If you want the
change made let me know and I'll call Northwest Orient (if you want
to do it yourself, their tel. is 1-800-447-4747). Do you need a hotel
in Anchorage?
∂05-Jun-85 1538 TULEY@SU-SCORE.ARPA msg
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 5 Jun 85 15:37:54 PDT
Date: Wed 5 Jun 85 15:37:36-PDT
From: Kimberly Tuley <TULEY@SU-SCORE.ARPA>
Subject: msg
To: jmc@SU-AI.ARPA
Hello,
Peg Chapla, of Digital, would like you to please confirm if you will be
attending the Micro-VAX show tomorrow at Tressider in the Oak West Rm.
from 10 - 2.
408-748-4190
Kim
-------
∂05-Jun-85 1726 WILKINS@SUMEX-AIM.ARPA Re: your mci card
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 5 Jun 85 17:26:15 PDT
Date: Wed 5 Jun 85 17:26:40-PDT
From: David C. Wilkins <WILKINS@SUMEX-AIM.ARPA>
Subject: Re: your mci card
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Wed 5 Jun 85 17:00:00-PDT
John
I forwarded your message to AI planning David Wilkins.
--the AI learning David Wilkins
-------
∂05-Jun-85 1908 RESTIVO@SU-SCORE.ARPA chess win
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 5 Jun 85 19:08:35 PDT
Date: Wed 5 Jun 85 19:09:23-PDT
From: Chuck Restivo <RESTIVO@SU-SCORE.ARPA>
Subject: chess win
To: JMC@SU-AI.ARPA
3.6.85 4pm Last of three game set
GM Vladamir Buschlovitz Black
M Charles Restivo White
37.Kc2 Kb7 38. Nc1 Kc6 39. Kb3 Kb5 40.
Na2 Bh4 41. Be1 f6 42. Nxb4 fxe5 43. dxe5
Bg5 44. Nc2 Kc6 45. Nd4+ Kd7 46. Kxa3
Bxh6 47. Kb3 Bf4 48. Nf3 h5 49. Bc3 Bh6 50.
Bb4 Bg7 51. Bd6 Bh6 52. Kc3 Bg7 53. Kd3
Bh6 54. Ke2 Bc1 55. Kf1 Bb2 56. Bc5 Kc6 57.
Bd4 Bc1 58. Kg2 Bf4 59. Be3 Bxe3 60. fxe3 d4
61. exd4 Kd5 62. kg3 Ke4 63. Ng5+ Kxd4 64.
Kf4 Kd5 65. nf3 Kc4 66. Kg5 Kd5 67. Kf6 f4
68. Nh4 Ke4 69. Kxe6 f3 70. Nxf3 Kxf3 71.
Kf5 h4 72. e6 h3 73. e7h2 74. e8=Q Kg2 75.
Kg4, Black Resigns
if 75. ... h1=Q White forces mate with 76.
Qe2+Kg1 77. Kg3.
-------
∂05-Jun-85 2055 VAL names without denotations
What do you think about the name "The street where Sherlock Holmes lived"?
Presumably it is synonimous with "Baker Street". Then we either have to say
that it has a denotation, and then to admit that even such a nice function as
"location" doesn't satisfy the black hole axiom, or to say that it has no
denotation, and admit that "exists" is not extensional.
The reason why I am interested in this is that I encountered more technical
difficulties trying to solve the frame problem for blocks using circumscription,
and I can possibly overcome them if write the axiom
location(b,result(move(b,l),s)))=l
without any additional conditions. Other axioms tell us that the left-hand
side may not exist, but even so we would consider it synonimous with the
right-hand side. The problem with this is that it makes "exists" non-
extensional, as in the example above. Would you find it disgusting?
∂06-Jun-85 0603 BH point-to-point mail
I don't think it's just the technical lack of a name server that keeps
uucp from doing direct point-to-point dialups. I think it is supposed
to be cheaper this way. That's especially true for small sites when you
have a few people with WATS lines and such who are willing to forward
your traffic for you. It is rumored that DEC spends $10K/month on
forwarding UUCP mail.
∂06-Jun-85 1007 WILKINS@SUMEX-AIM.ARPA Re: your mci card
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 6 Jun 85 10:07:46 PDT
Date: Thu 6 Jun 85 10:08:01-PDT
From: David C. Wilkins <WILKINS@SUMEX-AIM.ARPA>
Subject: Re: your mci card
To: JMC@SU-AI.ARPA
cc: winslett@SU-SCORE.ARPA, wilkins@SRI-KL.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Wed 5 Jun 85 17:00:00-PDT
John
My wife, Marianne Winslett Wilkins, eats lunch every day in the CSD
lounge, so its possible the MCI card you found in the book belongs to me.
Does 856-8850+11614 appear on the card? If so, Marianne (MJH 440), would
be happy to drop by your office for the card.
Hopefully, its mine -- since, otherwise, there is yet another David
Wilkins roaming around to cause confusions such as this one ...
David
-------
∂06-Jun-85 1027 WILKINS@SRI-AI.ARPA [John McCarthy <JMC@SU-AI.ARPA>: your mci card ]
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 6 Jun 85 10:27:28 PDT
Date: Thu 6 Jun 85 09:28:12-PDT
From: Wilkins <WILKINS@SRI-AI.ARPA>
Subject: [John McCarthy <JMC@SU-AI.ARPA>: your mci card ]
To: jmc@SU-AI.ARPA
cc: wilkins@SUMEX-AIM.ARPA
As the following message was resent to me from WILKINS@sumex I assume
this MCI card belongs to neither of the David Wilkinses known to us.
(I do not use MCI and have never read a book in the CSD lounge.)
perhaps there is a third David Wilkins lurking. Rutie needn't save
the card for me.
David E Wilkins
---------------
Date: 05 Jun 85 1700 PDT
From: John McCarthy <JMC@SU-AI.ARPA>
Subject: your mci card
To: wilkins@SUMEX-AIM.ARPA
ReSent-Date: Wed 5 Jun 85 17:21:55-PDT
ReSent-From: David C. Wilkins <WILKINS@SUMEX-AIM.ARPA>
ReSent-To: wilkins@SRI-KL.ARPA
You left it as a bookmark in "Retief: diplomat at arms" in the CSD lounge.
I picked up the book and found it, assuming, as has always been the case,
that science fiction left there was donated for public use. Anyway your
card is in my Rutie's office 360. If you also want the book back, I have
it.
-------
∂06-Jun-85 1051 RA anchorage trip
What have you decided about your trip to Alaska? Do you want to use a foreign
carrier to go directly to anchorage or do you want to go through Seattle with
North West? The price quoted to me this morning by the Omega travel agency
was higher than the one given to me by North West yesterday. Omega says
that it will cost you an additional sum of $528.26.
∂06-Jun-85 1101 CLT
i don't think i will feel like supper tonight
∂06-Jun-85 1128 INGRID@SU-CSLI.ARPA Your talk at the ASL Meeting
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 6 Jun 85 11:28:16 PDT
Date: Thu 6 Jun 85 11:06:23-PDT
From: Ingrid Deiwiks - 497-3084 <INGRID@SU-CSLI.ARPA>
Subject: Your talk at the ASL Meeting
To: jmc@SU-CSLI.ARPA
Dear Prof. McCarthy,
Your talk has been scheduled for Thursday, July 18. You can choose
between 9 am and 10 am. Let me know as soon as possible which time
slot you prefer, please.
Sincerely,
Ingrid Deiwiks
-------
∂06-Jun-85 1139 INGRID@SU-CSLI.ARPA re: Your talk at the ASL Meeting
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 6 Jun 85 11:39:42 PDT
Date: Thu 6 Jun 85 11:36:35-PDT
From: Ingrid Deiwiks - 497-3084 <INGRID@SU-CSLI.ARPA>
Subject: re: Your talk at the ASL Meeting
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Thu 6 Jun 85 11:38:00-PDT
Okay, that's when it will be.
-------
∂06-Jun-85 1247 CLT Remarks on Beeson's Logic and Knowledge
To: JMC, VAL
Here are remarks I sent to Beeson. They are grouped under the following headings.
General impressions
About situations
Vaguaries
Specific complaints, remarks, questions, ...
Typos and other trivia
----------------------------------------------------------------------
----------------------------------------------------------------------
General impressions
() It seems to me that the two main ideas are:
(i) the alternative notion of default reasoning, and
(ii) the notion of situation as a form of control structure.
These both seem like interesting and important alternatives to
``traditional'' approaches and well worth exploring.
Also the notion of subjunctive reasoning seems important.
I think more needs to be done about specifying formal connections
between deducing effects from axioms about effects of actions vs
acting an measuring the effect.
() I was somewhat disappointed at the lack of ``real mathematics''.
Although the basic ideas seem interesting and worth pursuing
I would find the paper much more interesting and valuable
if there were some results about properties of the formalism.
----------------------------------------------------------------------
----------------------------------------------------------------------
About situations
Situations seem to have some of the aspects of classes of objects
ala Small Talk or Simula, or FLAVORS ala LISP - which are also
ways of organizing information. Inheritance of information
from super classes is a key feature and problem
(since many cases really require multiple superclasses).
It seems that dynamically - when you are in a situation
you arrived there from exactly one parent situation
carrying along what you knew before - so indeed we have
tree structure.
Statically a situation may appear in several independent
situations - a presumably may thus inherit different
contexts at different times
So it seems that somehow the procedural semantics and dynmaics
resolves the ambiguity of what is inherited
Perhaps this should be pointed out in the paper - maybe even
developed more considering the importance of issues of
rganizing information and inheritances in traditional
knowledge representation systems.
Doing a situation seems to proceed from entry conditions to goals
while the usual Prolog mode is to work from goals backward.
Am I wrong about situations?
Some References
Small Talk - Goldberg and Robson (Addison-Wesley).
Flavors - Weinreb and Moon - Lisp Machine Manual
(also Tech report MIT?)
Touretsky - Thesis CMU- The mathematics of Inheritance Systems
and references there in
----------------------------------------------------------------------
----------------------------------------------------------------------
Vaguaries
() The role of negation is not clear. The literals is used
which to me implies that if A is a proposition so is ¬A.
Is this true? What about ¬A for actions?
() Traditionally in unification based systems, instances need not
be ground instances. Can actions be called on anything other than
ground instances?
() Having been told the procedure for ``doing'' a situation
I am still unclear about where they fit in the grand scheme.
How is it intended they are to be used?
Suppose entry conditions for several situations are satisfied
which one are we in?
How might one specify and verify situations ??
() If I were to write a program to implement this formalism
I don't beleive I have enough information to say whether
it is correct.
----------------------------------------------------------------------
----------------------------------------------------------------------
Specific complaints, remarks, questions, ...
0. Introduction
para 3. claims to there is both procedural and declarative semantics
(a) I don't see any evidence of declarative semantics
(b) There needs to be a formal connection between the two!!
1. Default reasoning ...
Basically I agree with Vladimir that the distinction between
default reasoning ala Reiter and default reasoning ala Beeson
made clearer - perhaps with some simple examples of information
represented in each system, comparing / contrasting what is possible
in each system. A comparison of the mathematical
properties of the two notions would be really helpful as well.
The claim is that one can get declarative effect of unless clauses
in prolog by adding negations of unless elements to the if part.
It is my impression that negation is not admitted in the
declarative semantics of prolog.
At best it is a metamathematical notion about provable
not about true.
Perhaps a more precise spelling out of the declarative semantics
of unless rules would make this clear. Otherwise a more convincing
argument is needed!
4.
it seems to me that the example illustrating the distinction between
knowing how to do X and knowing the effects of doing X
has illustrated another distinction - namely knowing how to do X and
being able to do X - the child may even know that turning the
knob will open the door, but not be able to do so
Versions of assert and retract -- what are these? actions no doubt?
Are they part of the basic system which just hasn't been
spelled out or something the user could define?
5. About programs that must function in a world where agents may act
at will not under programs control --
I would say that programs that control assembly line
robots, chemical processes (analysis, reactions) etc.
do this. A robust operating system must also.
About programs concerning themselves with goals of other
agents -- I think Kurt Konolige's thesis and related work addresses
this issue. (Electronic address Konolige@SRI-AI.ARPA.)
8. What is mean by ``clause'' in ``E is a list of clauses'' ?
A proposition? an action? a set of literals?
10. The chess example
How do you intend to express formally such things as
``the play sofar''
``a line (of play) that resulted in a disadvantage recently''
It seems important in general to be able to do so, but ..
11. Planning
Precisely what does it mean to have proved such things as
E implies A1
Ai {fire(Ri)} Ai+1
An+1 implies ∧G
(foot)
Is it clear that there is a manageable 2nd order fragment?
Perhaps metamathematics is more suitable?
Actually, I don't see how forming a plan using axioms
for reasoning about the effects of an action should
cause an attempt to execute the action.
12.
How do we check ``postconditions'' are satisfied?
Could checking have side-effects???
If plan fails - how do we know what instance of E holds now?
Might finding and instance that holds cause side-effects??
13.
Here my capacity for fuzzy english examples has been exceeded
Sorry
----------------------------------------------------------------------
----------------------------------------------------------------------
Typos and other trivia
4. (end) principle (2)
The meaning of can(x,A) is that agent is able to ...
insert ``x'' after agent
9. defn scritp clause (2) ``n-the''
10.
The opening game situation needs to be set off more clearly
Seemed confusing what those goals and rules belonged to at first
``x'' is used for the white player and also for the line of play
11. end of para.1 ``sequence of proposition Ai''
propositions
3rd para. before 12. ``prnvision''
12.
Using A for both propositions and subsituations is confusing
∂06-Jun-85 1259 SJG folly
have you ever known me to desist in ANY foolishness? You will be
welcome, however late.
Matt
∂06-Jun-85 1422 RA anchorage
You can go on Japan Airlines; you will have to add $410.00. I can
do the reservation by phone and you can change the ticket at the airport.
Would you like me to make you a resevation for June 23 to Anchorage and
June 30 Anchorage SF?
∂06-Jun-85 1534 TULEY@SU-SCORE.ARPA message
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 6 Jun 85 15:34:04 PDT
Date: Thu 6 Jun 85 15:34:03-PDT
From: Kimberly Tuley <TULEY@SU-SCORE.ARPA>
Subject: message
To: jmc@SU-AI.ARPA
Jack Cate 321-1225
-------
∂06-Jun-85 1531 RA trip to anchorage
You have a reservation on Japan Airline for June 23rd, flight no. 415.
Depart Tokyo 9:30pm, arrives Anchorage 11:05pm. On June 30 you have
a reservation on Northwest Orient, flight 82 12:00 noon to Seattle,
arrives 4:00pm, flight 684 to SF, departs 4:30pm, arrives SF 6:17pm.
∂06-Jun-85 1645 GENESERETH@SUMEX-AIM.ARPA ai qual
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 6 Jun 85 16:44:54 PDT
Date: Thu 6 Jun 85 16:44:45-PDT
From: Michael Genesereth <GENESERETH@SUMEX-AIM.ARPA>
Subject: ai qual
To: TOB@SU-AI.ARPA, Buchanan@SUMEX-AIM.ARPA, Feigenbaum@SUMEX-AIM.ARPA,
JMC@SU-AI.ARPA, Nilsson@SU-SCORE.ARPA, Rosenbloom@SUMEX-AIM.ARPA,
tw@SU-AI.ARPA
Well it looks as if we have only four candidates this year. I've
finalized the schedule for the exam and appended it below.
Note that each of us (except Paul and Tom) are requested to sit
on 2 committees and attend the plenary meeting at 12:30.
mrg
1985 AI Qual Schedule
Haddad 9:00 MJH 252
Feigenbaum
McCarthy
Winograd (chair)
Holstege 9:00 MJH 301
Buchanan (chair)
Genesereth
Nilsson
Rosenbloom
Hirsh 11:00 MJH 252
Feigenbaum
McCarthy
Winograd (chair)
Lamping 11:00 MJH 301
Buchanan (chair)
Genesereth
Nilsson
Joint Qual Committee Meeting 12:30-13:00 MJH 252
All events on Thursday June 13th.
-------
∂06-Jun-85 1703 RA tickets
I left your airline tickets on your desk.
∂06-Jun-85 2323 CHEESEMAN@SRI-AI.ARPA Probability in AI Workshop
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 6 Jun 85 23:23:47 PDT
Date: Thu 6 Jun 85 23:22:51-PDT
From: CHEESEMAN@SRI-AI.ARPA
Subject: Probability in AI Workshop
To: aaai-office@SU-SCORE.ARPA, blum@SUMEX-AIM.ARPA, bledsoe@UTEXAS-20.ARPA,
buchanan@SUMEX-AIM.ARPA, cheeseman@SRI-AI.ARPA, fuzzy1@AIDS-UNIX.ARPA,
georgeff@SRI-AI.ARPA, grosof@SU-SCORE.ARPA, jmc@SU-AI.ARPA,
jeffery@SU-CSLI.ARPA, judea@UCLA-LOCUS.ARPA, laws@SRI-AI.ARPA,
pednault@SRI-AI.ARPA, reboh@SRI-AI.ARPA, ruspini@SRI-AI.ARPA,
sjg@SU-AI.ARPA, shore@NRL-CSS.ARPA, shortliffe@SUMEX-AIM.ARPA,
wiederhold@SUMEX-AIM.ARPA
Information on the Workshop on:
Probability and Uncertainty in Artificial Intelligence
Sponsored by: AAAI and RCA
University of California, Los Angeles, August 14-16, 1985
------------------------------------
Registration Fee: Early (before July 10) $25
Late $30
The registration fee includes admission to all presentations,
discussions, patio lunches as well as the published proceedings.
Registration and refund requests will not be accepted after 5th. of
August. Registrations will be accepted on-site.
Accomodations: Single Residence Hall Room 4 nights $160
Single room accomodations have been reserved through the UCLA
conference services in university dormitories. Rates are based on a
four day period starting the evening of Tuesday August 13th. and
ending Sat. morning Aug. 17th. Check in is after 3:00p.m., check out
by 12:00 noon. Breakfast and dinner are included starting with dinner
on Tue. and ending with breakfast on Sat. 17th. Residence hall rooms
are provided with linens and towels. Shared bathroom facilities are
provided. The entire room payment for the four nights period must be
enclosed with your reservation (unless you are making your own
accomodation arrangements).
Parking: Parking permit $15
Note:
-No registration or refund after Aug. 5th.
-There are a limited number of rooms--please make your reservations
early.
-Return registration and accomodation forms to the arrangements
chairman.
Arrangements Chair: General Chair: Program Chair:
Rob. Suritis Peter Cheeseman John Lemmer
Par Technology Corp. NASA/Ames Research RCA Advanced Tech.
220 Seneca Turnpike Center, Mail Stop 244-7 Labs., Route 38,
New hartford, NY 13413 Moffett Field, CA 94035 Moorestown,
(315)738-0600 x233 (415)694-6526 NJ 08057
(609)866-6650
Registration Information should include:
Name, address, ARPA address (if any), phone number, parking permit
required ($15), date and time of arrival and whether you will be
attending IJCAI.
Checks payable to AI Workshop at UCLA, and the registration
information (and checks) should be sent to Rob. Suritis, PAR
Technology Corp., 220 Seneca Turnpike, New Hartford, NY 13413. The
workshop will occur in Sproul Hall, UCLA.
Proposed Agenda
---------------
Tue. Aug. 13th.
3:00 Registration and check-in front desk Sproul Hall
Wed. Aug 14th.
8:30 Session 1: Foundatiions of Probability Theory
10:00 Break (20 min)
10:20 Session 1 (cont.)
12:00 Patio Lunch
1:00 Session 2: Comparison of different Uncertainty Formalisms
3:00 Break
3:30 Session 2 (cont.)
5:00 Break for day
Thurs Aug. 15th.
8:30 Session 3: Induction of Models under uncertainty
10:00 Break
10:20 Session 4: Combining Uncertain Information and
Model Update from Data
12:00 Patio Barbecue
1:00 Session 5: Alternative Uncertainty Formalisms
3:00 Break
3:30 Session 6: Subjective Probability and Uncertainty
5:00 Break for day
Fri. Aug. 16th.
8:30 Session 7: Applications of Probability theory
10:00 Break
10:20 Session 8: Decision Making under Uncertainty
12:00 End of Workshop
-------
∂07-Jun-85 0140 HST gwai85
hi john.i hope nothing has changed.will you deliver a written paper (for our
proceedings?)? we have got many papers on deduction and logic programming.
herbert
∂07-Jun-85 0900 JMC
tickets for Texas, Squires.
∂07-Jun-85 0900 JMC
tickets to texas
∂07-Jun-85 1052 KUO Make an appointment
May I make an appointment to talk with you for about 15 minutes sometime today?
Thanks!
-- Victor
∂07-Jun-85 1101 RA staff meeting
I am at a staff meeting 11:00-1:00.
∂07-Jun-85 1144 RPG Thesis Ideas
To: ullman@SU-AIMVAX.ARPA, JJW@SU-AI.ARPA, JMC@SU-AI.ARPA
I think Joe's plans are fairly reaslistic, though I'm not sure how
many experiments he can get done in a reasonable amount of time
using the simulators available. I think mine is the slowest, but could
be sped up with hacking.
Another idea he might like to try is the idea of the impatient future,
which might have a strong role in AI programs. An impatient future
is like any other future, but it has a default case associated with it.
(impatient-future <form> <default-form>)
It is spawned as usual, but when the spawning process requires the
actual value, if that value is not ready, then the requesting
process performs the default computation and uses that instead.
Also, testing futures for completion might be an interesting concept.
In terms of the shared queue, I think that worrying about its impact
on speed is akin to worrying about the women in a strip show showing
their ankles. The game is to worry about AI programming, and pointer-heavy
languages.
In a grid of computers, pointers will contaminate across memory
boundaries a lot of the time. This results in a fair amount of
memory traffic across memory inter-connects and a garbage collection
headache. So the shared queue is a part of the whole problem, but
probably a small part.
-rpg-
∂07-Jun-85 1300 JMC
bibel
∂07-Jun-85 1449 RA IGCAI
Joyce from IGCAI called to let you know that the Beverly Hilton is sold out;
you did not state on your application a 2nd and 3rd choice. Still available
are: Bel Air Sand, Beverly Hills Ramada, Beverly Hillcrest and Westwook Marquis.
Her tel: (213) 488 0211. Tell me which one you want and I'll call her.
∂07-Jun-85 2000 JMC
sarah
∂07-Jun-85 2318 SG Okamura (my father-in-law) / address and phone
To: JMC
CC: SG
My father-in-law's address:
Dr. Sogo Okamura
4-12-15 Numabukuro, Nakano-ku
Tokyo 165 Japan
phone: 03-388-2751
(03 is Tokyo area code, Shiba Park Hotel is in the same area.)
I will inform him of your arriving and leaving dates.
Let me repeat; you will arrive in Japan on June 15 (Sat) and leave from
Japan on June 24 (right?).
Shigeki
∂08-Jun-85 0102 RUOFF@JPL-ROBOTICS.ARPA TECHIE
Received: from JPL-ROBOTICS.ARPA by SU-AI.ARPA with TCP; 8 Jun 85 01:02:26 PDT
Date: 8 Jun 1985 0003 PST
From: Carl Ruoff <RUOFF@JPL-ROBOTICS.ARPA>
Subject: TECHIE
To: JMC@SU-AI
Reply-To: RUOFF@JPL-ROBOTICS.ARPA
JOHN,
I NOW HAVE THE NAME OF A SUITABLE TECHIE FOR YOUR DITCH DAY ADVISING NEEDS.
HE IS DAN SCHWARTZ. FRED CULICK, MY ADVISOR, ASSURES ME HE IS JUST THE TYPE
YOU NEED, AND HE ACTUALLY HAS SOME SOCIAL SENSE. I DO NOT KNOW HIM MYSELF.
UNFORTUNATELY, I DO NOT YET HAVE HIS ADDRESS, BU I AM WORKING ON THAT.
REGARDS,
CARL
------
∂10-Jun-85 0003 JMC
Carolyn's birthday
∂10-Jun-85 0113 LLW@S1-A.ARPA SDI Computing
Received: from S1-A.ARPA by SU-AI.ARPA with TCP; 10 Jun 85 01:13:23 PDT
Date: 10 Jun 85 0103 PDT
From: Lowell Wood <LLW@S1-A.ARPA>
Subject: SDI Computing
To: jmc@SU-AI.ARPA
CC: LLW@S1-A.ARPA
∂07-Jun-85 1659 JMC@SU-AI.ARPA SDI inquiry
Received: from SU-AI.ARPA by S1-A.ARPA with TCP; 7 Jun 85 16:59:19 PDT
Date: 07 Jun 85 1654 PDT
From: John McCarthy <JMC@SU-AI.ARPA>
Subject: SDI inquiry
To: llw@S1-A.ARPA
A (the) San Jose newspaper was referred to me for "the other side" by
CPSR types. I told them that I thought computing and programming would
be a solvable problem, but I didn't know whether AI would be involved.
It later occurred to me that there might be actual experts to whom I
should have referred the reporter. Should I pass the buck on such
matters - and to whom. From some points of view my ignorance may be
an advantage. I am, however, willing to punch holes in anyone's arguments
that some specific computer program is impossible.
[John: Thanks very much for the inquiry. Actually, the "10 million lines
of code" hysteria has no basis in SDIO requirements documents known to
me--the whole deal appears to be a funding hustle by the computing
science/software engineering community that has got a bit out of hand. I
don't know to whom you might refer a reporter who is permitted to speak on
the subject--you're as well-qualified as anyone I know to declaim on the
topic publicly. Lowell]
∂10-Jun-85 1102 RUOFF@JPL-ROBOTICS.ARPA TECHIE MAIL
Received: from JPL-ROBOTICS.ARPA by SU-AI.ARPA with TCP; 10 Jun 85 11:00:35 PDT
Date: 10 Jun 1985 1045 PST
From: Carl Ruoff <RUOFF@JPL-ROBOTICS.ARPA>
Subject: TECHIE MAIL
To: JMC@SU-AI
Reply-To: RUOFF@JPL-ROBOTICS.ARPA
Dear Dr. McCarthy,
my apologies. The message regarding a caltech student was intended for
John Craig, who has a friend TV writer who has need of an advisor for a
script loosely based on ditch day. I should have addressed the mail to
JJC rather than JMC. At any rate, though we don't really know each other
except for the ffact that you offered me a job (for Tom Binford) once, I
send my regards.
Carl Ruoff
------
∂10-Jun-85 1102 YAO@SU-SCORE.ARPA Shapiro
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 10 Jun 85 11:00:24 PDT
Date: Mon 10 Jun 85 11:00:17-PDT
From: Andrew Yao <YAO@SU-SCORE.ARPA>
Subject: Shapiro
To: JMC@SU-AI.ARPA
cc: yao@SU-SCORE.ARPA
John, I received from Nils a copy of Shapiro's letter and vita. His credentials
look pretty good to me. If you think we should ask him to visit during his
stay in the US this summer, please go ahead and invite him. If there is
anything I can do on this matter, please let me know. I will be around
after July 15 until August 30 this summer.
Thanks.
--Andy
-------
∂11-Jun-85 0806 AI.JMC@MCC.ARPA 3600s
Received: from MCC.ARPA by SU-AI.ARPA with TCP; 11 Jun 85 08:05:51 PDT
Date: Tue 11 Jun 85 10:05:31-CDT
From: AI.JMC@MCC.ARPA
Subject: 3600s
To: les@SU-AI.ARPA
cc: jmc@SU-AI.ARPA
I forgot to mention that Tom Binford is cooking up a deal with
Symbolics and asked if we wanted in. The price seemed good, and I
told him you would call him. We can discuss it tomorrow or Thursday
when I return. I forget whether I told you I'm going to Japan Friday
and will go from there to Alaska and will be back about the 30th.
-------
∂11-Jun-85 0924 RA Prof. Leo Goodman
Prof. Leo Goodman is a Prof. of Statistics at the Univ. of Chicago; he is a
current fellow at the
Center for Advanced Studies. He would like to talk to you re his son who
is a sophmore in college and who is interested in AI. The son is interested
in working in AI this summer, not necessarily for money. Goodman's tel.
is (9) 321 8052.
∂11-Jun-85 1519 RA IGCAI
You got a room at the Bevely Hilton.
∂11-Jun-85 1547 AI.JMC@MCC.ARPA letter
Received: from MCC.ARPA by SU-AI.ARPA with TCP; 11 Jun 85 15:46:55 PDT
Date: Tue 11 Jun 85 17:46:50-CDT
From: AI.JMC@MCC.ARPA
Subject: letter
To: ra@SU-AI.ARPA
cc: jmc@SU-AI.ARPA
Please look for a letter from J.W. Lloyd on my desk. Incidentally,
the meeting is IJCAI not IGCAI and the hotel is the Beverley Hilton.
-------
∂11-Jun-85 1552 RA [Reply to message recvd: 11 Jun 85 15:32 Pacific Time]
The visa application is here. I did part of it. Please leave me your passport
so that I can go and get you the visa.
∂11-Jun-85 2300 JMC
passport
∂12-Jun-85 0000 JMC
mackworth sato
∂12-Jun-85 0129 RMS@MIT-MC.ARPA Job: full-time GNU hacker wanted (please post widely)
Received: from MIT-MC.ARPA by SU-AI.ARPA with TCP; 12 Jun 85 01:29:35 PDT
Date: Wed, 12 Jun 85 04:30:26 EDT
From: Richard M. Stallman <RMS@MIT-MC.ARPA>
Subject: Job: full-time GNU hacker wanted (please post widely)
To: jmc@SU-AI.ARPA, dek@SU-AI.ARPA, fateman@UCB-VAX.ARPA,
larus@UCB-VAX.ARPA
Message-ID: <[MIT-MC.ARPA].539715.850612.RMS>
A philanthropist has offered to hire a full-time person
for the GNU project to develop a free Unix-compatible operating
system.
I am looking for a person who can write and maintain large programs,
and willing to work hard. He will work on the kernel and optimizing C
compiler, together with me and some other volunteers.
The funding comes in six month units, so I could take someone
for six months or for multiples of that. Even if you are interested
just for the summer, it is a possibility. Someone in or willing
to move to the Boston area would be best, since the other people
working on these projects are here, and our hardware will be here.
One problem: the money disappears if not spent by June 19.
If you are interested, inquire quickly.
Send mail to rms@mit-mc, or phone me at (617) 253-8830 or (617) 876-6819.
If you can't reach me, contact Professor Sussman at MIT.
∂12-Jun-85 0940 RA visa
I am off to SF to take care of your visa and ticket.
∂12-Jun-85 1501 JMM comments on your msg--India vs China
To: JMC
CC: JMM
I think that one has to distinguish between the industrial sector and
the agricultural sector. As far as the industrial sector goes, some of
the comments made in the article are quite valid. India's industrial
sector has suffered as a consequence of the inefficiencies which come by
in a clumsy attempt to control the economy. The converse is not necessarily
true, however I would like to be optimistic and think that Rajiv Gandhi's
dose of the free market will do good to India's industrial sector. There is
a caveat though-- I think that the international trade atmosphere is likely to
become more and more protectionist in the 80's and 90's(Mondale's campaign planks,
European protectionism etc) and what worked out for Japan, Korea etc may not
work in today's environment. India will have to rely on the domestic market
and there one has to face demand constraints.
As far as the agricultural sector goes, and which is what is relevant for 70%
of the population in India and China, the free market approach is not likely
to help at all. The vicious constraints due to absentee landlordism, feudal
bondage and caste relationships etc are just too powerful to be left to the
free market to dissolve. I think that is where the Chinese revolution had its
greatest impact. While the food production in India has indeed gone up, 40% of
the country remains below the poverty line. Industrial growth will have to be
unrealistically high to make a dent in this figure. If a wide-ranging land reform
and redistribution program could be instituted in the current democratic
framework, that would perhaps be best. However there are strong arguments from
the left that it is unrealistic to expect such a program given the current
power structure. That puts one in a really uncomfortable dilemma- because it
is true that most communist regimes have degenerated after the initial
days of the revolution.
Anyway, perhaps we should have a chat about these issues sometime.
Jitendra
∂12-Jun-85 1712 RA Sarah
Sarah wanted to find out about dinner. She'll call later.
∂12-Jun-85 1730 SHAWN@SU-SUSHI.ARPA CS206 Grade and Thanks
Received: from SU-SUSHI.ARPA by SU-AI.ARPA with TCP; 12 Jun 85 17:30:18 PDT
Date: Wed 12 Jun 85 17:30:50-PDT
From: shawn Amirsardary <SHAWN@SU-SUSHI.ARPA>
Subject: CS206 Grade and Thanks
To: jmc@SU-AI.ARPA
Dear Dr. McCarthy:
I wanted to thank you for being so helpful and accomodating my request to
take CS206 as independent study. Ross and especially Gianluigi were very
very helpful.
Before you decided on my grade I wish to stress that I did NOT have access
to the video tapes, and as such was at a severe disadvantage. Nevertheless
I think it all worked out well and I learned a lot.
Many Thanks,
Shawn A.
PS: Thanks to you I finished my degree--viz you will not have to put up
with my rambling on the bboard anymore.
-------
∂12-Jun-85 2052 GLB
Prof McCarthy, I have graded the homeworks and the midterm of Shawn. The results
are as follows:
homework 1 155/155
homework 2 30/30
homework 3 44/60
midter 22/30
(final 35 + ... /100)
(Ross and I have graded our questions in the final and the total is 35;
the dots refer to your question)
∂12-Jun-85 2254 LES re: WAITS to TEX conversion
[In reply to message rcvd 12-Jun-85 22:14-PT.]
I don't think it is necessary to turn anything off -- you have to turn
things ON if you want that.
I don't see any reason to translate the left & right braces -- they are OK
ASCII characters. On the other hand, I think that you need to translate
"\" in the source into a macro, to avoid ambiguity.
I believe that you should also add some large dimensions such as the
following at the top to avoid reformatting or clipping:
.device tty
.page frame 300 high 150 wide;
.area text lines 1 to 300;
.place text
Incidentally, I can't fiddle the file; it is write-protected against me.
∂13-Jun-85 0905 CLT jmc
Here is where I'll be -
Maybe you want to give Susie some of the phon numbers -
Seattle is easier to reach than Japan
Thursday night
Arnold (Louise and Harold) 503-228-1065
Friday-Sunday
Kotowski,Haru and Don 206-759-5582
Monday-Tuesday
ter Meulen, Alice (Dr. A.) 206-527-0532 (home) 206-543-4374 (ofc)
return Tuesday afternoon
∂13-Jun-85 1038 RINDFLEISCH@SUMEX-AIM.ARPA Instructional Lisp Machines
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 13 Jun 85 10:37:42 PDT
Date: Thu 13 Jun 85 10:36:58-PDT
From: T. C. Rindfleisch <Rindfleisch@SUMEX-AIM.ARPA>
Subject: Instructional Lisp Machines
To: Nilsson@SU-SCORE.ARPA, Feigenbaum@SUMEX-AIM.ARPA, Buchanan@SUMEX-AIM.ARPA,
Genesereth@SUMEX-AIM.ARPA, JMC@SU-AI.ARPA, LES@SU-AI.ARPA, TOB@SU-AI.ARPA
cc: Rindfleisch@SUMEX-AIM.ARPA, Bosack@SU-SCORE.ARPA, Yeager@SUMEX-AIM.ARPA
Friends, as most of you know, the KSL is about to make a large purchase of Lisp
workstations for research. As a fallout of negotiating with TI, Symbolics, and
Xerox, we have offers of very advantageous discounts for a quantity of machines
beyond what the KSL can buy (see below). Noting that the department has
already invested in 2060, (micro) VAX, Macintosh, and other hardware resources
for various non-AI parts of CSD, Nils is considering buying $100-200K worth of
workstations for AI instructional purposes. Nils wants to discuss this
possibility among the AI faculty as soon as possible. Can we meet for an hour
early next week? Nils is available afternoons after 1:30 on Monday through
Wednesday. Please let me know you schedule preferences.
Tom R.
SUMMARY OF CONFIDENTIAL PRICING:
VENDOR # MACHINES PRICE COMMENTS
TI 25 $22K/mach Package deal, 25 mach for $540K.
DARPA/ISI price $54K.
Symbolics 6 or 8 45K/mach Package deal, 6/8 mach for $270/360K.
DARPA/ISI price $69K
Xerox Variable 14-22K/mach Purchase quantity scalable. List price
on 6085 is $18-19K.
MACHINE CONFIGURATIONS:
TI Explorer with 8 MB memory, 2 x 140 MB disk, and Ethernet
Symbolics 50:50 mix of 3640's and 3600's with 8 MB memory, 169 MB disk, and
Ethernet. The 8 machine deal would also include one 450 MB
disk.
Xerox $14K machine = newly announced 6085 with 3.7 MB memory, 80 MB
disk, 8K control store, and Ethernet. Also, IBM PC-compatible
co-machine internally. (Xerox guarantees this machine will
perform as well as the current 1109 or will replace them with
the same number of 1109's).
$22K machine = 1109 with 3.5 MB memory, 80 MB disk, 12K control
store, and Ethernet.
PS: To date, TOB has expressed research interest in piggy backing on this buy
but JMC/LES have not. If this changes, I need to know by early next week. The
KSL will buy a mix of about $800K of this hardware.
-------
∂13-Jun-85 1246 YAO@SU-SCORE.ARPA Shapiro's visit
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 13 Jun 85 12:46:19 PDT
Date: Thu 13 Jun 85 12:46:27-PDT
From: Andrew Yao <YAO@SU-SCORE.ARPA>
Subject: Shapiro's visit
To: JMC@SU-AI.ARPA, Nilsson@SU-SCORE.ARPA, Ashok@SU-SCORE.ARPA
cc: yao@SU-SCORE.ARPA
I'm going to arrange for Ehud Shapiro to visit us during his trip to the
West Coast in August. Could you let me know the "bad" dates for you
in August? Since it is possible that he is planning to come at a time
very close to the AI meeting in LA, it will be helpful if you can supply
me the dates as specific as possible.
Thanks.
--Andy
ps. I did not send this message to Christos, since I know that he is going
away in July and August.
-------
∂13-Jun-85 1306 SJG probability workshop
To: "@PCONF.DIS[1,SJG]"@SU-AI.ARPA
If I can find three other interested parties, I'll probably fly down
to LA for the probability workshop rather than take a commercial flight.
The scoop is that it will take a bit longer (the flight's 2 1/2 or 3 hours,
and we might have to stop for fuel) and probably cost about $320 for
however many people end up going. It should be a lot more fun than
dealing with SFO, though. I will be coming back to Palo Alto for the
weekend, and then repeating this foolishness on Tuesday for IJCAI.
(The IJCAI flight is already sold out, of course.)
Any takers?
Matt Ginsberg
Does this note make sense? I'm a private pilot; the $320 would be split
among n of us ...
∂13-Jun-85 1350 RA J.W. Lloyd
I found Lloyd's letter. It's on your desk. You might want to write him
a different letter, now that you have his letter.
∂13-Jun-85 1348 MRC@SU-SCORE.ARPA Re: concepts of fairness
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 13 Jun 85 13:48:46 PDT
Date: Thu 13 Jun 85 13:48:14-PDT
From: Mark Crispin <MRC@SU-SCORE.ARPA>
Subject: Re: concepts of fairness
To: JMC@SU-AI.ARPA
cc: su-bboards@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Wed 12 Jun 85 21:42:00-PDT
Postal-Address: 725 Mariposa Ave. #103; Mountain View, CA 94041-1869
Phone: 1 (415) 968-1052
JMC has ignored the crucial question in this fairness issue,
which is whether or not the original PBS documentary had a
left-wing bias. I have not seen the documentary or the
"rebuttals", so I cannot judge. Perhaps as a more or less
moderate leftist I might find the PBS documentary to have a
right-wing bias!
If it did not, then we may very well have a far-right
attempt to "rebut" a balanced documentary with propaganda,
presented as opposing "left" vs. "right" viewpoints. In this
case, the Reagan administration's interference IS chilling.
If it did, then Accuracy in Media has a damned good case for
wanting to present its point of view. My only objection is that
Accuracy in Media's presentation is probably going to be so
ultra-right in its viewpoints that it will not fairly present the
right's viewpoint. The best ally the moderate left has is the
ultra-right and ultra-right propaganda.
As a social democrat I would prefer to sway the opinions of
others by their agreement with my viewpoints, rather than by
reaction against nutso opponents. It is intellectually more
satisfying to debate a political opponent you wouldn't mind being
seen with socially.
-------
∂13-Jun-85 1406 RA Frank, Dina Bolla
Frank would like you to call him (9) 329 0950.
∂13-Jun-85 1416 MRC@SU-SCORE.ARPA Vietnam: trying to be moderate
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 13 Jun 85 14:15:46 PDT
Date: Thu 13 Jun 85 14:15:59-PDT
From: Mark Crispin <MRC@SU-SCORE.ARPA>
Subject: Vietnam: trying to be moderate
To: JMC@SU-AI.ARPA
cc: su-bboards@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Wed 12 Jun 85 21:42:00-PDT
Postal-Address: 725 Mariposa Ave. #103; Mountain View, CA 94041-1869
Phone: 1 (415) 968-1052
One of the so-called left-wing biases of the PBS documentary
is the presentation of Ho Chi Minh's political beliefs and the
human degradation in South Vietnam.
Ho Chi Minh lived and died a political enigma. He founded a
communist party without ever joining it, drew up a declaration of
independence and constitution virtually word-for-word copied from
the US ones, and spent many years in Paris, Moscow, and New York
City. In many ways, he pursued non-aligned policies; Vietnam's
present strongly pro-Moscow policies appeared some years after
his death. When he proclaimed Vietnam's independence, he
infuriated Moscow by snubbing them and seeking aid from President
Truman instead (in his famous letter). What was Ho Chi Minh? I
don't think history's books have closed on the man, and probably
they won't for another 50 years. I think it's wrong to call him
a "hardened communist" or a "Jeffersonian democrat", since in
many ways he was both and neither.
The human degradation in South Vietnam has been well
documented by many sources. South Vietnam was a nation filled
with orphans and abandoned children, almost all of whom were
boys. Why so few homeless girls? Because they could be put to
cash-earning work at a much younger age than boys as child
prostitutes; 13-year-olds were seasoned veterans. The South
Vietnamese government was filled with gangsters up to the topmost
levels (Thieu, Ky, Diem). Today, Thieu and Ky are deeply
embroiled with "disagreements" with the law in the USA and
France; Ky has been tied to several drug operations.
Whether or not the current Vietnamese government is a
gangster government is irrelevant. Maybe it is, but we aren't
supporting that government. I object to the idea of supporting
gangsters just because their enemies are Russia's gangsters. I
do not want *my* country backing gangsters of any variety, which
is why I object today to aid to the Nicaraguan contras.
The South Vietnamese government was so corrupt, it couldn't
even hold its own against a relatively small offensive. In early
1975, it went from firm control of most of the country to
surrender, leaving large amounts of US-given military hardware
sitting unused. South Vietnam surrendered with hardly a fight.
The main concern of those at the top was packing their money in
their suitcases and going. I believe this is the ultimate and
inevitable result of backing gangsters.
-------
∂13-Jun-85 1423 MRC@SU-SCORE.ARPA re: Support Senate Bill 329 (from SAIL's BBOARD)
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 13 Jun 85 14:23:33 PDT
Date: Thu 13 Jun 85 14:23:43-PDT
From: Mark Crispin <MRC@SU-SCORE.ARPA>
Subject: re: Support Senate Bill 329 (from SAIL's BBOARD)
To: JMC@SU-AI.ARPA
cc: OTHER-SU-BBOARDS@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Wed 12 Jun 85 21:49:00-PDT
Postal-Address: 725 Mariposa Ave. #103; Mountain View, CA 94041-1869
Phone: 1 (415) 968-1052
It was a Congressional authorization to the President to set a
"temporary emergency" speed limit early in 1974 (that's under Nixon,
folks). The authorization expired years ago. Since then, the White
House under Ford, Carter, and Reagan has declined to lift the threatened
ax of federal highway funding and Congress has declined to take action
to force it.
Reagan promised in '80 that he would remove 55 but hasn't done
anything about it until just recently. He apparently has taken the
viewpoint that he won't do anything about it without Congressional
action.
-------
∂13-Jun-85 1445 SG Masahiko's address
To: JMC
CC: SG
Masahiko's address.
"hplabs!kddlab!nttmecl!ccut!a1458"@Berkeley (via Berkely)
"mcvax!kddlab!nttmecl!ccut!a1458"@seismo.ARPA (via Europe)
A friend of mine at NTTMECL recommended me to use Berkely.
It takes about eighteen hours from SAIL to CCUT.
---------
Shigeki
∂13-Jun-85 1524 avg@diablo re: Support Senate Bill 329
Received: from SU-AIMVAX.ARPA by SU-AI.ARPA with TCP; 13 Jun 85 15:23:57 PDT
Date: Thu, 13 Jun 85 15:24:05 pdt
From: Allen VanGelder <avg@diablo>
Subject: re: Support Senate Bill 329
To: JMC@Sail, su-bboards@diablo
Maybe it's true that enforcing a policy beyond the scope of federal powers
thru funding pressure is against the spirit of the Constitution, but
so is federal funding itself. Some people only cite the Constitution
when the merits of the issue are against them (I am NOT accusing JMC of this).
If the federal government is going to act against the spirit of the
Constitution frequently, which seems to be the case, then sensible debate
will focus only on the merits: SHOULD or SHOULD NOT we have a 55 speed
limit for the general welfare of the people and other life forms?
As far as I can tell, the only argument against it is "I want to go faster."
I consider the claims that "its dangerous to obey the limit" to be
exaggerated. I drive about 55, and sure a lot of people whiz by, but
a lot don't. I don't feel in any danger as a result of "only going
the speed limit." The safety benefits of the lower speed limit are well
documented.
∂13-Jun-85 1649 TREITEL@SU-SUSHI.ARPA re: Support Senate Bill 329
Received: from SU-SUSHI.ARPA by SU-AI.ARPA with TCP; 13 Jun 85 16:49:08 PDT
Date: Thu 13 Jun 85 16:49:37-PDT
From: Richard Treitel <TREITEL@SU-SUSHI.ARPA>
Subject: re: Support Senate Bill 329
To: avg@SU-AIMVAX.ARPA
cc: JMC@SU-AI.ARPA, su-bboards@SU-AIMVAX.ARPA, treitel@SU-SUSHI.ARPA
In-Reply-To: Message from "Allen VanGelder <avg@diablo>" of Thu 13 Jun 85 15:48:10-PDT
There is also an economic argument: people and freight items tend to be less
economically productive while they are on the road being moved from point A to
point B than when they have arrived at point B, and this loss of productivity
can outweigh the fuel saved by lower speeds.
This argument finds its best application when the times and distances involved
are long, hence the proposal to raise the limit on *rural* highways.
- Richard
-------
∂13-Jun-85 1702 RA lodging in Alaska
Frank called; so far he hasn't been able to find a motel or hotel for you;
he has difficulties because Anchorage is hosting a mayors' convention and
the big chains seem to be full. He is going to keep trying tomorrow. In case
he runs out of toll-free numbers how many long-distance calls should he make?
He said he can try smaller hotels which do not have toll-free numbers.
He did get you a medium size car from Hertz.
The confirmation number is: 56435658650; unlimited
mileage for $269.97 a week.
Also, is there a place I can get in touch with you while you are in Japan?
Could you leave me your new American Express credit card number?
Frank will be in his office until 5:30.
Have a good trip.
Denali Park Hotel, 907 683-2218, confirmed by Beth, conf number 2357
reservation 907 683-2215
∂13-Jun-85 1704 RA David Chudnovsky
David called; he will try to reach you later.
∂13-Jun-85 1914 YAO@SU-SCORE.ARPA re: Shapiro's visit
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 13 Jun 85 19:14:02 PDT
Date: Thu 13 Jun 85 19:14:19-PDT
From: Andrew Yao <YAO@SU-SCORE.ARPA>
Subject: re: Shapiro's visit
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Thu 13 Jun 85 13:16:00-PDT
Thanks for the information.
--Andy
-------
∂14-Jun-85 0832 AI.LENAT@MCC.ARPA Re: next visit
Received: from MCC.ARPA by SU-AI.ARPA with TCP; 14 Jun 85 08:30:39 PDT
Date: Fri 14 Jun 85 10:30:36-CDT
From: AI.LENAT@MCC.ARPA
Subject: Re: next visit
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Thu 13 Jun 85 21:48:00-CDT
John,
As you may recall (I believe Dick Martin spoke with you about this
months ago) the White House has asked a group of us to think about
how it manages national crises, and make some recommendations both
from our paradigm's vantage point and also about whether and how
current AI might help them. Specifically, we are doing this for
Ron Hinckley at the W.H. Crisis Management Center (originally, we
were arranging this with Richard Beale).
A small meeting will be held on June 28 at the White House, with
John Seely Brown, Randy Davis, and myself, finding out what the current
procedures and systems are. From that should come a short (2-4 pp)
paper of issues to discuss.
On Saturday, August 17, a larger group of us -- hopefully including
you! -- will meet in L.A. to hold that discussion. We've scheduled
this to fall just before IJCAI, since most of us will want to be
in L.A. that following week anyway. You'll be getting a letter soon
(with an actual consulting agreement) and a follow-up of a few articles
to read, plus this issues paper once it's written. The agreement is
just to cover your time ($2k/day) and expenses; if you don't have any
official consulting time available then I hope you'll come as a friend
of the family (i.e., the Family of Man).
This note is just to jog your memory, and get Aug. 17th in L.A. blocked
off on your calendar, and give you time to change your travel
plans to IJCAI if you weren't planning on going down that early.
You might even just want to come down for a day trip, as for Inference;
that's what Ed Feigenbaum is doing -- and then come back to IJCAI
later the following week.
Please respond by net or phone if you'd like to talk about this
(home: 512-328-2801, office: 512-834-3436), or can't make it,
or wonder what I'm talking about.
On other fronts: I've proposed some July visitation dates to Woody,
and when we converge we'll get back to you about that (probably today.)
Regards,
Doug
-------
∂14-Jun-85 1015 KONOLIGE@SRI-AI.ARPA default reasoning
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 14 Jun 85 10:15:18 PDT
Date: Fri 14 Jun 85 10:15:09-PDT
From: Kurt Konolige <Konolige@SRI-AI.ARPA>
Subject: default reasoning
To: jmc@SU-AI.ARPA
cc: nilsson@SU-SCORE.ARPA, val@SU-AI.ARPA, konolige@SRI-AI.ARPA
John, I have the following challenge for circumscription. It
seems to me that one of the main types of default reasoning one would
like a robot to do is "prototypical:" given that an individual A is a
member of class P, we would like to assume that A has all of the
attributes of a prototypical member of the class, unless we have
evidence to the contrary. This is the type of reasoning, I think,
that the old inheritance hierarchies tried to capture. For the sake
of argument, let us say that the inference
(A) if Tweety is a bird, and nothing denies it, than Tweety
can fly
is an instance of such reasoning.
Here is the challenge: how to implement inference (A) above
using circumscription, without also making inferences that are not
sanctioned by prototypical default reasoning. In particular, suppose
nothing is known about any individual being a bird; it is arguable
that prototypical reasoning does NOT allow us to conclude that all
birds fly. That is, we must allow for states of knowledge with the
following characterstics:
(1) No individual birds are known
(2) It is not known whether any birds exist
(3) If birds exist, it is not known whether they fly or not
(4) If any individual bird becomes known as a bird, and
nothing else is known about it, then it will be assumed to fly.
1-4 describe a state of knowledge in which prototypical defaults are
used to infer characteristics of individual birds, but don't sanction
any generalizations about the relationship between birds and flying.
Now the use of the AB predicate in circumscription to
implement (A) is typically given as:
(A') Bird(x) /\ -AB(x) -> Fly(x)
But Circum(A';AB;AB) |- Ax. Bird(x) -> Fly(x), which violates
(3).
--kk
-------
∂14-Jun-85 1148 JF@SU-SUSHI.ARPA i agree with you
Received: from SU-SUSHI.ARPA by SU-AI.ARPA with TCP; 14 Jun 85 11:48:31 PDT
Date: Fri 14 Jun 85 11:49:05-PDT
From: Joan Feigenbaum <JF@SU-SUSHI.ARPA>
Subject: i agree with you
To: jmc@SU-AI.ARPA
i don't want to participate in the smoking discussion on bboard, but if i
understand your comment about self-righteousness and smoking correctly, i
agree with you completely. it's obviously very fashionable to give smokers
a hard time right now, and i think many people are grossly exaggerating their
sensitivity to smoke. my grandmother smoked in my presence the entire time i
was growing up and i don't remember my parents or i ever having any trouble
breathing or feeling tempted to start smoking. i think people enjoy feeling
superior because they have the willpower not to indulge in this bad habit and
want to flaunt it in front of others. very tiresome. especially from
liberals who claim to be very tolerant and open-minded.
-------
∂14-Jun-85 1156 AI.LENAT@MCC.ARPA Re: next visit
Received: from MCC.ARPA by SU-AI.ARPA with TCP; 14 Jun 85 11:55:56 PDT
Date: Fri 14 Jun 85 13:55:34-CDT
From: AI.LENAT@MCC.ARPA
Subject: Re: next visit
To: JMC@SU-AI.ARPA
cc: ai.woody@MCC.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Thu 13 Jun 85 21:48:00-CDT
John,
July 23-24 would be good for both Woody and myself. Is that OK?
Glad you can make the Aug 17 meeting, too.
Regards,
Doug
-------
∂14-Jun-85 1249 FEIGENBAUM@SUMEX-AIM.ARPA Re: leaf blowers
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 14 Jun 85 12:49:42 PDT
Date: Fri 14 Jun 85 12:49:27-PDT
From: Edward Feigenbaum <FEIGENBAUM@SUMEX-AIM.ARPA>
Subject: Re: leaf blowers
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Fri 14 Jun 85 09:50:00-PDT
Their use has not been restricted enough, so someone ought to find out
what Kennedy thinks "restricted" means--so we can "restrict" them even more.
Ed
-------
∂14-Jun-85 1551 RINDFLEISCH@SUMEX-AIM.ARPA Re: Instructional Lisp Machines
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 14 Jun 85 15:51:30 PDT
Date: Fri 14 Jun 85 15:51:17-PDT
From: T. C. Rindfleisch <Rindfleisch@SUMEX-AIM.ARPA>
Subject: Re: Instructional Lisp Machines
To: Nilsson@SU-SCORE.ARPA, Feigenbaum@SUMEX-AIM.ARPA, Buchanan@SUMEX-AIM.ARPA,
Genesereth@SUMEX-AIM.ARPA, JMC@SU-AI.ARPA, LES@SU-AI.ARPA, TOB@SU-AI.ARPA,
Cheriton@SU-PESCADERO.ARPA
cc: Bosack@SU-SCORE.ARPA, Yeager@SUMEX-AIM.ARPA, Rindfleisch@SUMEX-AIM.ARPA
In-Reply-To: Message from "T. C. Rindfleisch <Rindfleisch@SUMEX-AIM.ARPA>" of Thu 13 Jun 85 10:37:23-PDT
It appears the best common time for a meeting on instructional Lisp machines is
Tuesday afternoon at 5:00. Modulo the fact that JMC is out of the country and
I have not heard from Les Earnest yet, can we agree to meet then in Nils's
conference room?
Tom R.
-------
∂14-Jun-85 1604 FEIGENBAUM@SUMEX-AIM.ARPA Re: Instructional Lisp Machines
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 14 Jun 85 16:03:17 PDT
Date: Fri 14 Jun 85 16:03:05-PDT
From: Edward Feigenbaum <FEIGENBAUM@SUMEX-AIM.ARPA>
Subject: Re: Instructional Lisp Machines
To: Rindfleisch@SUMEX-AIM.ARPA, Nilsson@SU-SCORE.ARPA, Buchanan@SUMEX-AIM.ARPA,
Genesereth@SUMEX-AIM.ARPA, JMC@SU-AI.ARPA, LES@SU-AI.ARPA, TOB@SU-AI.ARPA,
Cheriton@SU-PESCADERO.ARPA
cc: Bosack@SU-SCORE.ARPA, Yeager@SUMEX-AIM.ARPA
In-Reply-To: Message from "T. C. Rindfleisch <Rindfleisch@SUMEX-AIM.ARPA>" of Fri 14 Jun 85 15:51:22-PDT
My week next week is simply outrageously bad. I don't have strong feelings
other than this one:
strong feeling that our teaching of AI should be supported by , and
facilitated by, the most modern of LISP machine environments. We need
to be at the cutting edge, in our courses as well as our labs. For courses,
Symbolics machines are too expensive. Go for Xerox or TI machines.
An interesting augmentation to whatever we do is:
ExperLisp on the 512K MacIntosh (we can negotiate a $300/machine price)
and ExperOPS5 which runs on ExperLisp (probably can get this for under $100
per machine).
So, in short, yes spend $200,000 on LISP machines for the students.
Also, more students than just AI students will benefit. LISP machines are
growing to be a "workstation of choice" for CAD applications and for
some software development applications and for some CAE applications.
E.g. the CAD division of MCC has more LISP machines than the AI division!!
Unless dragged kicking and screaming, I will be in a virtual sense
"out of the country" (or more accurately "out to lunch").
Ed
-------
∂14-Jun-85 2156 GENESERETH@SUMEX-AIM.ARPA Re: Instructional Lisp Machines
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 14 Jun 85 21:56:42 PDT
Date: Fri 14 Jun 85 21:56:43-PDT
From: Michael Genesereth <GENESERETH@SUMEX-AIM.ARPA>
Subject: Re: Instructional Lisp Machines
To: Rindfleisch@SUMEX-AIM.ARPA
cc: Nilsson@SU-SCORE.ARPA, Feigenbaum@SUMEX-AIM.ARPA, Buchanan@SUMEX-AIM.ARPA,
JMC@SU-AI.ARPA, LES@SU-AI.ARPA, TOB@SU-AI.ARPA, Cheriton@SU-PESCADERO.ARPA,
Bosack@SU-SCORE.ARPA, Yeager@SUMEX-AIM.ARPA
In-Reply-To: Message from "T. C. Rindfleisch <Rindfleisch@SUMEX-AIM.ARPA>" of Fri 14 Jun 85 15:51:22-PDT
Tuesday at 5:00 is fine for me.
mrg
-------
∂15-Jun-85 1024 NILSSON@SU-SCORE.ARPA Re: Shapiro's visit
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 15 Jun 85 10:24:03 PDT
Date: Sat 15 Jun 85 10:24:23-PDT
From: Nils Nilsson <NILSSON@SU-SCORE.ARPA>
Subject: Re: Shapiro's visit
To: YAO@SU-SCORE.ARPA
cc: JMC@SU-AI.ARPA, Ashok@SU-SCORE.ARPA, NILSSON@SU-SCORE.ARPA
In-Reply-To: Message from "Andrew Yao <YAO@SU-SCORE.ARPA>" of Thu 13 Jun 85 12:46:30-PDT
The August Situation (relative to a visit by Ehud Shapiro):
July 29-Aug 2: OK except for 29 Aug
Aug 5 - Aug 9: OK
Aug 12 - Aug 16: OK
Aug 19 - Aug 23: IJCAI --not OK
Aug 26 - Aug 30: OK
I'd like to make plans that would "un-OK" some of these dates, so let me
know as soon as you suggest a date. -Nils
-------
∂15-Jun-85 1100 NILSSON@SU-SCORE.ARPA Re: Instructional Lisp Machines
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 15 Jun 85 10:50:41 PDT
Date: Sat 15 Jun 85 10:50:42-PDT
From: Nils Nilsson <NILSSON@SU-SCORE.ARPA>
Subject: Re: Instructional Lisp Machines
To: Rindfleisch@SUMEX-AIM.ARPA
cc: Feigenbaum@SUMEX-AIM.ARPA, Buchanan@SUMEX-AIM.ARPA,
Genesereth@SUMEX-AIM.ARPA, JMC@SU-AI.ARPA, LES@SU-AI.ARPA, TOB@SU-AI.ARPA,
Cheriton@SU-PESCADERO.ARPA, Bosack@SU-SCORE.ARPA, Yeager@SUMEX-AIM.ARPA,
NILSSON@SU-SCORE.ARPA
In-Reply-To: Message from "T. C. Rindfleisch <Rindfleisch@SUMEX-AIM.ARPA>" of Fri 14 Jun 85 15:53:45-PDT
Tuesday afternoon at 5 pm sounds fine to me. Y'all come. -Nils
-------
∂15-Jun-85 1118 NILSSON@SU-SCORE.ARPA AI Retreat Concluded
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 15 Jun 85 11:17:31 PDT
Date: Sat 15 Jun 85 11:17:44-PDT
From: Nils Nilsson <NILSSON@SU-SCORE.ARPA>
Subject: AI Retreat Concluded
To: Feigenbaum@SUMEX-AIM.ARPA, Genesereth@SUMEX-AIM.ARPA, TW@SU-AI.ARPA,
JMC@SU-AI.ARPA, Rosenbloom@SUMEX-AIM.ARPA, Buchanan@SUMEX-AIM.ARPA,
TOB@SU-AI.ARPA, Shortliffe@SUMEX-AIM.ARPA
cc: nilsson@SU-SCORE.ARPA
Let's settle on the date of Friday, August 2 for the AI Retreat. No one
excluded that date as a possibility, so let's tie it up before our
complicated calendars consume it for some other purpose. I think we
can easily fill up a day discussing matters of importance to all of us
and to AI at Stanford. Please circulate suggested agenda topics; I'll keep
a record of them and will then propose an agenda.
Also, any suggestions about venue will be welcome. Let's plan to cap
off the day with a 7 pm (or so) dinner with spouses?
-Nils
-------
∂15-Jun-85 2220 udi%wisdom.bitnet@WISCVM.ARPA Talk
Received: from WISCVM.ARPA by SU-AI.ARPA with TCP; 15 Jun 85 22:19:54 PDT
Received: from (UDI)WISDOM.BITNET by WISCVM.ARPA on 06/16/85 at
00:20:05 CDT
From: Ehud Shapiro <udi%wisdom.bitnet@WISCVM.ARPA>
Date: Sun, 16 Jun 85 08:16:07 -0200
To: jmc@su-ai.arpa
Subject: Talk
Dear John,
Would you like to schedule a talk for me during my visit at Stanford?
The preferred date is the beginning of the week after IJCAI,
Monday, August 26 or Tueday, August 27. The title of my
talk is:
"The Magic of Partial Evaluation,
or
Meta-interpreters for Real"
An abstract will follow.
Regards,
Ehud Shapiro
≠
∂17-Jun-85 1023 TW
To: nilsson@SU-SCORE.ARPA
CC: TW@SU-AI.ARPA, JMC@SU-AI.ARPA, TOB@SU-AI.ARPA,
genesereth@SUMEX-AIM.ARPA, buchanan@SUMEX-AIM.ARPA,
rosenbloom@SUMEX-AIM.ARPA, feigenbaum@SUMEX-AIM.ARPA,
shortliffe@SUMEX-AIM.ARPA
August 2 is fine (and so marked in my calendar). We have a rigid family
policy of having Friday night dinners with the whole family. If you
want to make it a family barbeque/swim, I could try to reserve the
group area at SCRA.
∂17-Jun-85 1004 VAL Re: default reasoning
To: konolige@SRI-AI.ARPA
CC: JMC@SU-AI.ARPA, nilsson@SU-SCORE.ARPA
I have two different answers to your challenge.
1. In the formulas describing the ability of birds to fly, variables range not
over all things in the world, but only over those that are relevant to our
reasoning. We are studying a small part of the world, a "situation" in the
sense of Barwise and Perry. If your axioms are so weak that they don't imply
the existence of even one bird then there are no birds in the "situation" in
question, and there is nothing wrong with the conclusion that all (relevant)
birds can fly.
2. But if we want to interpret the variables as ranging over the whole universe
then your criticism is valid, and here is a way out. Introduce a new unary
predicate, REL ("relevant"), and the convention that for every constant c
in the language, REL(c) should be automatically added to the list of axioms.
The condition REL(x) should be added as another conjunctive term to the
antecedent of (A'). Then we'll be only able to prove that all relevant birds
can fly, and that will imply that Tweety and all other birds whose names are
available in the language can fly. (Generally, we should automatically add
the axioms saying that each function available in the language preserves REL,
including all Skolem functions for existential axioms).
- Vladimir
∂17-Jun-85 1450 KONOLIGE@SRI-AI.ARPA Re: default reasoning
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 17 Jun 85 14:50:16 PDT
Date: Mon 17 Jun 85 14:50:50-PDT
From: Kurt Konolige <Konolige@SRI-AI.ARPA>
Subject: Re: default reasoning
To: VAL@SU-AI.ARPA
cc: JMC@SU-AI.ARPA, nilsson@SU-SCORE.ARPA
In-Reply-To: Message from "Vladimir Lifschitz <VAL@SU-AI.ARPA>" of Mon 17 Jun 85 10:04:00-PDT
Vladimir, I think the challenge is still a challenge, even if one
allows either (1) or (2) of your reply. I agree that we often want to
restrict our attention to a subset of the individuals in the universe.
This we can do by letting the domain be just those individuals, or intro-
ducing a predicate REL, or by some other method. No problem here.
However, that is not the point of the challenge. I will repeat the
conditions: I want to represent the state of knowledge of an agent
with the following properties:
(1) No individual birds are known
(2) It is not known whether any birds exist
(3) If birds exist, it is not known whether they fly or not
(4) If any individual bird becomes known as a bird, and
nothing else is known about it, then it will be assumed to fly.
This is a fairly weak state of knowledge, and must be encoded by
axioms that are also weak--in particular, I want the agent to be
uncertain as to whether there are any birds at all (although this is
not really crucial to the argument). The point is that
circumscription acts like a sledgehammer, in that it always forces an
agent to assume more about the world than is truly warranted by
default reasoning about prototypes. In this case, I am perfectly
happy allowing only ``relevant'' individuals to be considered as part
of the domain; however, I also demand that (1)--(4) above hold for all
relevant individuals. This seems to me to be a reasonable state of
knowledge for an agent. The challenge is to represent it using
circumscription.
--kk
-------
∂17-Jun-85 1524 NILSSON@SU-SCORE.ARPA Re: default reasoning
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 17 Jun 85 15:24:29 PDT
Date: Mon 17 Jun 85 15:17:28-PDT
From: Nils Nilsson <NILSSON@SU-SCORE.ARPA>
Subject: Re: default reasoning
To: Konolige@SRI-AI.ARPA
cc: VAL@SU-AI.ARPA, JMC@SU-AI.ARPA, NILSSON@SU-SCORE.ARPA
In-Reply-To: Message from "Kurt Konolige <Konolige@SRI-AI.ARPA>" of Mon 17 Jun 85 14:51:02-PDT
I think your conditions 3 and 4 are rather strange to insist on together.
Any particular motivation for wanting 3 (which seems to be very strange!)?
-Nils
-------
∂18-Jun-85 0153 @seismo.ARPA:munnari!mulga.oz!jwl@seismo.ARPA
Received: from SEISMO.ARPA by SU-AI.ARPA with TCP; 18 Jun 85 01:38:42 PDT
Return-Path: <munnari!mulga.oz!jwl@seismo.ARPA>
Received: from munnari.OZ by seismo.ARPA with UUCP; Tue, 18 Jun 85 04:38:44 EDT
Received: from mulga.OZ (mulga) by munnari with SMTP (4.44)
id AA11613; Tue, 18 Jun 85 18:15:31 EST
Received: by mulga (4.44)
id AA20044; Tue, 18 Jun 85 18:15:18 EST
Date: Tue, 18 Jun 85 18:15:18 EST
From: munnari!mulga.oz!jwl@seismo.ARPA (John Lloyd)
Message-Id: <8506180815.20044@mulga.OZ>
To: jmc@su-ai.ARPA
Professor McCarthy,
Thank you very much for your letter concerning the position at Stanford.
I wrote to you quite some time ago saying that I would be interested
in applying for the position, but so far I have not received any reply
from you. If this position is still open, I would greatly appreciate
it if you would arrange to send me further information.
I also mentioned in my letter that I would be in the U.S. in July for
the Logic Programming Conference at Boston.
Would it be possible for me to visit Stanford on the way back from the
conference? I would be happy to offer a seminar.
Unfortunately, the only possible days are Monday 22nd or Tuesday 23rd July.
I will be arriving in San Francisco late on the Sunday night and will
be flying back to Melbourne at 9pm on Tuesday 23rd.
So Monday afternoon or Tuesday morning or early afternoon would be best.
The other complication is that I am also trying to arrange to visit
IBM San Jose on one of these days.
If possible, I would prefer to visit you on the Tuesday, because it will
be easier for me to get back to the airport from Stanford.
This doesnt give you much flexibility and if you cannot fit me in, I will
quite understand.
I enclose an abstract. Thanks.
John Lloyd
**************************
A Basis for Deductive Database Systems
J.W. Lloyd
Department of Computer Science
University of Melbourne
This seminar is concerned with a theoretical basis for deductive database
systems. A deductive database consists of closed typed first order logic
formulas of the form A<-W, where A is an atom and W is a typed first
order formula. A typed first order formula can
be used as a query and a closed typed first order formula can be used
as an integrity constraint. Functions are allowed to appear in formulas.
Such a deductive database system can be implemented using a PROLOG system.
The main results are concerned with the soundness,
completeness and non-floundering of the query evaluation process,
the soundness of the implementation of integrity constraints,
and a simplification theorem for implementing integrity constraints.
An alternative query evaluation process will be presented.
Some remarks comparing this approach with the standard relational database
approach will also be made.
∂18-Jun-85 1142 RA Circuit from PA times
Ray 774 1521 from Palo Alto times called to let you know that the circuit
ordered is ready.
∂20-Jun-85 1348 AI.HILL@MCC.ARPA MCC Consulting Contract
Received: from MCC.ARPA by SU-AI.ARPA with TCP; 20 Jun 85 13:48:46 PDT
Date: Thu 20 Jun 85 15:47:50-CDT
From: AI.HILL@MCC.ARPA
Subject: MCC Consulting Contract
To: JMC@SU-AI.ARPA
cc: Woody@MCC.ARPA
Woody has asked me to contact you to see if I can help work the problem
you have with the MCC consulting contract. Please let me know by phone
(512-834-3510) or E-mail (Hill@MCC) the specifics of your objections and
I will attempt to find a solution to the problem.
Dick Hill
-------
∂20-Jun-85 1353 CLT calendar item
sat 13-jul 20:30 Joffrey SFO
∂21-Jun-85 1507 RA Fred Ris from IBM
Fred Ris is associated with IBM's parallel process prototype; would like
to discuss with you parallel LISP; would like to meet with you the
morning of July 9th. He will call back the week of July first. His
tel: (914) 945 1973. If it's ok with you please let me know and I will call
him.
∂22-Jun-85 1602 SHORTLIFFE@SUMEX-AIM.ARPA Re: AI Retreat
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 22 Jun 85 16:02:04 PDT
Date: Sat 22 Jun 85 16:01:44-PDT
From: Ted Shortliffe <Shortliffe@SUMEX-AIM.ARPA>
Subject: Re: AI Retreat
To: NILSSON@SU-SCORE.ARPA
cc: Feigenbaum@SUMEX-AIM.ARPA, Genesereth@SUMEX-AIM.ARPA, TW@SU-AI.ARPA,
JMC@SU-AI.ARPA, Rosenbloom@SUMEX-AIM.ARPA, Buchanan@SUMEX-AIM.ARPA,
TOB@SU-AI.ARPA
In-Reply-To: Message from "Nils Nilsson <NILSSON@SU-SCORE.ARPA>" of Tue 4 Jun 85 09:45:21-PDT
Office: Room TC-135, Stanford Med Center; Phone: (415) 497-6979
The August 2nd date has the disadvantage of being on a Friday -- the day I
routinely am committed to work in the Stanford clinic -- but with this much
lead time I think I can arrange cross coverage. If that date works for
everyone else, I'll make plans to be there.
| Ted
-------
∂24-Jun-85 1016 HEDGES@SU-SCORE.ARPA Visit of Jean-Claude Latombe
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 24 Jun 85 10:16:30 PDT
Date: Mon 24 Jun 85 10:16:18-PDT
From: Karen Hedges <HEDGES@SU-SCORE.ARPA>
Subject: Visit of Jean-Claude Latombe
To: Cannon@SU-SIERRA.ARPA, JMC@SU-AI.ARPA, TOB@SU-AI.ARPA,
Reynolds@SU-SCORE.ARPA, BScott@SU-SCORE.ARPA, Nilsson@SU-SCORE.ARPA
Jean-Claude Latombe (Robotics Candidate) will be visiting Stanford on
Tuesday, July 9.
Is there a particular time that the committe prefers to meet with him?
Please let me know as soon as possible so that I can finalize his schedule.
Thanks.
Karen
-------
∂24-Jun-85 1200 RA Sandra Cook SRI
Sandra Cook from SRI would like you to call her, 859 5478, re MAD Computer
∂24-Jun-85 1358 FEIGENBAUM@SUMEX-AIM.ARPA [AIList Moderator Kenneth Laws <AIList-REQUEST@SRI-AI>: AIList Digest V3 #82]
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 24 Jun 85 13:58:00 PDT
Date: Mon 24 Jun 85 13:57:50-PDT
From: Edward Feigenbaum <FEIGENBAUM@SUMEX-AIM.ARPA>
Subject: [AIList Moderator Kenneth Laws <AIList-REQUEST@SRI-AI>: AIList Digest V3 #82]
To: jmc@SU-AI.ARPA
JOHN, EMBEDDED HEREIN IS A SHORT DISCUSSION BY SOMEONE ON COMMON SENSE
REASONING. THOUGHT YOU MIGHT BE INTERESTED....ED
---------------
Return-Path: <LAWS@SRI-AI.ARPA>
Received: from SRI-AI.ARPA by SUMEX-AIM.ARPA with TCP; Mon 24 Jun 85 13:35:19-PDT
Date: Mon 24 Jun 1985 09:14-PDT
From: AIList Moderator Kenneth Laws <AIList-REQUEST@SRI-AI>
Reply-to: AIList@SRI-AI
US-Mail: SRI Int., 333 Ravenswood Ave., Menlo Park, CA 94025
Phone: (415) 859-6467
Subject: AIList Digest V3 #82
To: AIList@SRI-AI
AIList Digest Monday, 24 Jun 1985 Volume 3 : Issue 82
Today's Topics:
Queries - VAX Lisp & PC Lisps & McDonnell Douglas NL Breakthrough,
Games - Optimal Scrabble,
Automata - Predation/Cooperation,
Psychology - Common Sense,
Analogy - Bibliography,
Seminar - Evaluating Expert Forecasts (NASA)
----------------------------------------------------------------------
Date: Mon, 24 Jun 85 07:38:35 EDT
From: cugini@NBS-VMS
Subject: VAX Lisp
Just looking for a little consumer information here - does anyone have
any experience with Digital's VAX LISP ? DEC advertises it as a
full-fledged implementation of CommonLisp. Any remarks on price,
performance, quality, etc are appreciated.
John Cugini <Cugini@NBS-VMS>
Institute for Computer Sciences and Technology
National Bureau of Standards
Bldg 225 Room A-265
Gaithersburg, MD 20899
phone: (301) 921-2431
------------------------------
Date: Sun 23 Jun 85 15:09:12-EDT
From: Jonathan Delatizky <DELATZ%MIT-OZ@MIT-MC.ARPA>
Subject: PC Lisps
[Forwarded from the MIT bboard by SASW@MIT-MC.]
Can some of you out there who have used Lisp implementations on IBM PC
type machines give me some recommendations as to the best PC Lisp? I
plan to run it on a PC/XT and a PC/AT if possible. Also, any expert systems
shells that run on the same machines, real or toy-like.
...jon
------------------------------
Date: 22 Jun 1985 13:20-EST
From: George Cross <cross%lsu.csnet@csnet-relay.arpa>
Subject: McDonnell Douglas NL Breakthrough
The following is the text of a full page color ad on page 49
in the June 24, 1985 New Yorker. It has also been run in the
Wall Street Journal. Does anyone know what the breakthrough
is? This was mentioned on the ailist some time ago but I
didn't notice a response. There is a photo of a hand holding
the chin of smiling boy.
BREAKTHROUGH: A COMPUTER THAT UNDERSTANDS YOU LIKE YOUR MOTHER
Having to learn letter-perfect software languages can be frustrating to the
average person trying to tap the power of a computer.
But practical thinkers at our McDonnell Douglas Computer Systems Company
have created the first computer that accepts you as you are - human.
They emulated the two halves of the brain with two-level software: One level
with a dictionary of facts and a second level to interpret them. The
resulting Natural Language processor understands everyday conversational
English. So it knows what you mean, no matter how you express yourself. It
also learns your idiosyncrasies, forgives your errors, and tells you how to
find out what you're looking for.
Now, virtually anyone who can read and write can use a computer.
We're creating breakthroughs not only in Artificial Intelligence but also in
health care, space manufacturing and aircraft.
We're McDonnell Douglas.
How can I learn more?
Write
P.O. Box 19501
Irvine, CA 92713
------------------------------
Date: 22 Jun 1985 13:07-EDT
From: Jon.Webb@CMU-CS-IUS2.ARPA
Subject: Optimal Scrabble
Anyone interested in computer Scrabble should be aware that Guy
Jacobson and Andrew Appel (some of the people that did Rog-o-matic)
have written a program which in some sense solves the problem. Using a
clever data structure, their program makes plays in a few seconds and
always makes the best possible play. Their dictionary is the official
Scrabble dictionary. The program is not completely optimal because it
doesn't take into account how the placement of its words near things
like triple word scores may help the other player, but in all other
senses it always makes the best play. I suppose some simple strategic
techniques could be added using a penalty function, but as the program
almost always wins anyway, this hasn't been done. It regularly gets
bingos (all seven letters used), makes clever plays that create three
or more words, and so on. The version they have now runs on Vax/Unix.
There was some work to port it to the (Fat) Macintosh but that is not
finished, mainly for lack of interest.
Jon
------------------------------
Date: Fri, 21 Jun 85 17:17:58 EDT
From: David←West%UMich-MTS.Mailnet@MIT-MULTICS.ARPA
Subject: Predation/Cooperation (AIL v3 #78)
Re: enquiry of sdmartin@bbng about learning cooperation in predation:
For an extensive investigation of a minimal-domain model (prisoner's
dilemma),see ←The Evolution of Co-operation← (NY: Basic Books, 1984;
LC 83-45255, ISBN 0-465-02122-0) by Robert Axelrod (of the U of Mich).
He is in the Institute of Public Policy Studies, but one of his more
interesting methods was the use of the genetic algorithms of John
Holland (also of the U of Mich) to breed automata to have improved
strategies for playing Prisoner's dilemma. A one-sentence summary of
his results is that cooperation can displace non-cooperation if
individuals remember each other's behavior and have a high enough
probability of meeting again. An intermediate-length summary can be
found in Science ←211← (27 Mar 81) 1390-1396.
------------------------------
Date: Fri 21 Jun 85 19:23:03-PDT
From: Calton Pu <CALTON@WASHINGTON.ARPA>
Subject: definition of common sense
I had a discussion with a friend on this exact topic just a few weeks
ago. My conclusions can be phrased as an elaboration of V. Pratt's
two criteria.
1. common knowledge basis (all facts depended on must be
common knowledge)
I think the (abstract) common knowledge basis can be more concretely
described as "cultural background". Your Formico's Pizza example
shows clearly that anybody not familiar with San Francisco will not
have the "common sense" to go there. The term "cultural background"
admits many levels of interpretation (national, provincial, etc.)
so most of REALLY COMMON knowledge basis will be encompassed.
2. low computational complexity (easy to check the conclusion).
I think the key here is not the checking (NP), but the finding (P) of
the solution. So here I differ from Vaughan, in that I believe common
sense is something "obvious" to a lot of people, by their own
reasoning power.
There are two factors involved: the first is the amount of reasoning
power; the second is the amount of deductive processing involved. On
the first factor, unfortunately usual words to describe people with
the adequate reasoning power such as "sensible", "reasonable", and
"objective" have also the connotation of being "emotionless". Let's
leave out the emotional aspects and use the term "reasonable" to
include everybody who is able to apply elementary logic to normal
situations. On the second factor, typical words to picture easy
deductive efforts are "obvious", "clear", and "evident".
So my definition of common sense is: that which is obvious to a
reasonable person with an adequate cultural background.
I should point out that the three parameters of common sense, cultural
background, reasoning power, and deductive effort, vary from place to
place and from person to person. If we agreed more on each other's
common sense, it might be easier to negotiate peace.
------------------------------
Date: Monday, 24 Jun 85 01:38:08 EDT
From: shrager (jeff shrager) @ cmu-psy-a
Subject: Analogy Bibliography
[Someone asked for an analogy bibliography a while back. This was compiled
about two years (maybe more) ago so it's partial and somewhat out of date,
but might serve as a starter for people interested in the topic. I've added
a couple of thing just now in looking it over. The focus is primarily
psychological, but readers will recognize some of the principle AI work as
well. I've got annotations for quite a few of these, but the remarks are
quite long and detailed so I won't burden AIList with them. -- Jeff]
ANALOGY
(A partial bibliography)
Compiled by Jeff Shrager
CMU Psychology
24 June 1985
(Send recommendations to Shrager@CMU-PSY-A.)
Bobrow, D. G. & Winograd, T. (1977). An Overview of KRL: A Knowledge
Representation Language. Cognitive Science, 1, 3-46.
Bott, R.A. A study of complex learning: Theories and Methodologies. Univ. of
Calif. at San Diego, Center for Human Information Processing report No.
7901.
Brown, D. (1977). Use of Analogy to Acheive New Experience. Technical Report
403, MIT AI Laboratory.
Burstein, M. H. (June, 1983). Concept Formation by Incremental Analogical
Reasoning and Debugging. Proceedings of the International Machine
Learning Workshop. pp. 19-25.
Carbonell, J. G. (August, 1981). A computational model of analogical problem
solving. Proceedings of the Seventh International Joint Conference on
Artificial Intelligence, Vancouver. pp. 147-152.
Carbonell, J.G. (1983). Learning by Analogy: Formulating and Generalizing
Plans from Past Experience. In Michalski, R.S., Carbonell, J.G., &
Mitchell, T.M. (Ed.), Machine Learning, an Aritificial Intelligence
Approach Palo Alto: Tioga Press.
Carnap, R. (1963). Variety, analogy and periodicity in inductive logic.
Philosophy of Science, 30, 222-227.
Darden, L. (June, 1983). Reasoning by Analogy in Scientific Theory
Construction. Proceedings of the International Machine Learning Workshop.
pp. 32-40.
de Kleer, J. & Brown, J.S. Foundations of Envisioning. Xerox PARC report.
Douglas, S. A., & Moran, T. P. (August, 1983). Learning operator semantics by
analogy. Proceedings of the National Conference on Artificial
Intelligence.
Douglas, S. A., & Moran, T. P. (December, 1983b). Learning text editor
semantics by analogy. Proceedings of the Second Annual Conference on
Computer Human Interaction. pp. 207-211.
Dunker, K. (1945). On Problem Solving. Psychological Monographs, 58, .
Evans, T. G. (1968). A program for the solution of a class of geometric
analogy intelligence test questions. In Minsky, M. (Ed.), Semantic
Information Processing Cambridge, Mass.: MIT Press. pp. 271-253.
Gentner, D. (July, 1980). The Structure of Analogical Models in Science.
Report 4451, Bolt Beraneck and Newman.
Gentner, D. (1981). Generative Analogies as Mental Models. Proceedings of
the 3rd National Cognitive Science Conference. pp. 97-100. Proceedings
of the 3rd annual conference.
Gentner, D. (1982). Are Scientific Analogies Metaphors? In D. S. Miall (Ed.),
Metaphor: Problems and Perspectives New York: Harvester Press Ltd. pp.
106-132.
Gentner, D., & Gentner, D. R. (1983). Flowing Waters or Teeming Crowds: Mental
Models of Electricity. In Gentner, D. & Stevens, A. L. (Ed.), Mental
Models Hillsdale, NJ: Lawrence Earlbaum Associates. pp. 99-129.
Gick, M. L. & Holyoak, K. J. (1980). Analogic Problem Solving. Cognitive
Psychology, 12, 306-355.
Gick, M. L. & Holyoak, K. J. (1983). Schema Induction and Analogic Transfer.
Cognitive Psychology, 15, 1-38.
Halasz, F. & Moran, T. P. (1982). Analogy Considered Harmful. Proceedings of
the Conference on Human Factors in Computer Systems, New York.
Hesse, Mary. (1955). Science and the Human Imagination. New York:
Philisophical Library.
Hesse, Mary. (1974). The Structure of Scientific Inference. Berkeley: Univ.
of Calif. Press.
Kling, R. E. (1971). A Paradigm for Reasoning by Analogy. Artificial
Intelligence, 2, 147-178.
Lenat, D.B. & Greiner, R.D. (1980). RLL: A representation language language.
Proc. of the first annual meeting. Stanford.
McDermott, J. (December, 1978). ANA: An assimilating and accomodatiing
production system. Technical Report CMU-CS-78-156, Carnegie-Mellon
University.
McDermott, J. (1979). Learning to use analogies. Sixth Internation Joint
Conference on Artificial Intelligence.
Medin, D. L. and Schaffer, M. M. (1978). Context Theory of Classification
Learning. Psychological Review, 85(3), 207-238.
Minsky, M. (1975). A Framework for Representing Knowledge. In Winston, P.H.
(Ed.), The Psychology of Computer Vision New York: McGraw Hill.
Minsky, M. (July, 1982). Learning Meaning. Technical Report, . Unpublished
MIT AI Lab techinical report.
Moore, J. & Newell, A. (1974). How can MERLIN Understand? In L.W.Gregg (Ed.),
Knowledge and Cognition Potomic, Md.: Erlbaum Associates.
Ortony, A. (1979). Beyond Literal Similarity. Psych Review, 86(3), 161-179.
Pirolli, P. & Anderson, J.R. (1985) The role of Learning from Examples in the
Acquisition of Recursive Programming Skills. Canadian Journal of
Psychology. Vol. 39, no. 4; pgs. 240-272.
Polya, G. (1945). How to solve it. Princton, N.J.: Princeton U. Press.
Quine, W. V. O. (1960). Word and Object. Cambridge: MIT Press.
Reed, S. K., Ernst, G. W., & Banerji, R. (1974). The Role of Analogy in
Transfer Between Similar Problem States. Cognitive Psychology, 6,
436-450.
Rosch, E., Mervis, C. B., Gray, W. D., Johnson, D. M., & Boynes-Braem, P.
(1976). Basic Objects on Natural Kinds. Cog Psych, 8, 382-439.
Ross, B. (1982). Remindings and Their Effects in Learning a Cognitive Skill.
PhD thesis, Stanford.
Rumelhart, D.E., & Norman, D.A. (?DATE?). Accretion, tuning, and
restructuring: Three modes of learning. In R.Klatsky and J.W.Cotton
(Eds.), Semantic Factors in Cognition Hillsdale, N.J.: Erlbaum
Associates.
Rumerlhart, D.E. & Norman, D.A. (1981). Analogical Processes in Learning. In
J.R. Anderson (Ed.), Cognitive Skills and Their Acquisition Hillsdale,
N.J.: Lawrence Earlbaum Associates. pp. 335-360.
Schustack, M., & Anderson, J. R. (1979). Effects of analogy to prior knowledge
on memory for new information. Journal of Verbal Learning and Verbal
Behavior, 18, 565-583.
Sembugamoorthy, V. (August, 1981). Analogy-based acquisition of utterances
relating to temporal aspects. Proceedings of the 7th International Joint
Conference on Artificial Intelligence. pp. 106-108.
Shrager, J. & Klahr, D. (December, 1983). A Model of Learning in the
Instructionless Environment. Proceedings of the Conference on Human
Factors in Computing Systems. pp. 226-229.
Shrager, J. & Klahr, D. Instructionless Learning: Hypothesis Generation and
Experimental Performance. In preparation.
Sternberg, R. (1977). Intelligence, information processing, and analogical
reasoning: The componential analysis of human abilities. Hillsdale,
N.J.: Lawrence Erlbaum Associates.
VanLehn, K., & Brown, J. S. (1978). Planning nets: A representation for
formalizing analogies and semantic models of procedural skills. In Snow,
R. E., Frederico, P. A. and Montague, W. E. (Ed.), Aptitude Learning and
Instruction: Cognitive Process Analyses Hillsdale, NJ: Lawrence Erlbaum
Associates.
Weiner, E. J. A Computational Approach to Metaphore Comprehension. In the
Penn Review of Linguistics.
Winston, P. H. (December, 1980). Learning and Reasoning by Analogy.
Communications of the ACM, 23(12), 689-703.
Winston, P. H. Learning and Reasoning by Analogy: The details. MIT AI Memo
number 520.
------------------------------
Date: Fri, 21 Jun 85 11:42:26 pdt
From: gabor!amyjo@RIACS.ARPA (Amy Jo Bilson)
Subject: Seminar - Evaluating Expert Forecasts (NASA)
NASA
PERCEPTION AND COGNITION SEMINARS
Who: Keith Levi
From: University of Michigan
When: 10 am, Tuesday, June 25, 1985
Where: Room 177, Building 239, NASA Ames Research Center
What: Evaluating Expert Forecasts
Abstract: Probabilistic forecasts, often generated by an expert,
are critical to many decision aids and expert systems.
The quality of such inputs has usually been evaluated in
terms of logical consistency. However, in terms of
real-world implications, the external correspondence of
probabilistic forecasts is usually much more important
than internal consistency. I will discuss recently
developed procedures for evaluating external correspondence
and present research on the topic.
Non-citizens (except permanent residents) must have prior approval from
the Directors Office one week in advance. Permanent residents must show
Alien Registration Card at the time of registration.
To request approval or obtain further information, call 415-694-6584.
------------------------------
End of AIList Digest
********************
-------
∂25-Jun-85 1205 CLIFF@USC-ISI.ARPA Arpa Order 4912
Received: from USC-ISI.ARPA by SU-AI.ARPA with TCP; 25 Jun 85 12:05:45 PDT
Date: 25 Jun 1985 15:04:49 EDT
Subject: Arpa Order 4912
From: Rodger A. Cliff <CLIFF@USC-ISI.ARPA>
To: les@SU-AI.ARPA
cc: rpg@SU-AI.ARPA, jmc@SU-AI.ARPA
There is an item in my budget designated for ARPA Order 4912, contract #
N3982C0250 titled "S-1 Benchmark". We sent Stanford $173K in FY84, and
$187K in FY85. The plan calls for annother $201K to be sent in FY86.
My office director wants to know what we got for our money in FY84, what
we are getting for our money in FY85, and what qwe will get in FY86.
Please call me ASAP to discuss this (202)694-3624. I spoke breifly to
Dick Gabriel, but I need to know where Stanford stands on this. We need to ge
this effort defined to protect the funding.
Thanks,
Rodger Cliff
-------
∂26-Jun-85 0229 HST gwai85
hi john.do you know a little bit more about the amount of money i have to
spend for your travel?
∂26-Jun-85 0316 ARK TeX Videotape
To: SMC
CC: JMC, ARK
Can I please have my TeX videotape back? Thanks.
Arthur
∂26-Jun-85 0854 RA Beverly Hilton Reservation
The confirmation for your room in the Beverly Hilton is on your desk.
∂27-Jun-85 1343 HEDGES@SU-SCORE.ARPA Robotics Search Committee meeting with JC Latombe
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 27 Jun 85 13:43:41 PDT
Date: Thu 27 Jun 85 13:38:19-PDT
From: Karen Hedges <HEDGES@SU-SCORE.ARPA>
Subject: Robotics Search Committee meeting with JC Latombe
To: Cannon@SU-SIERRA.ARPA, JMC@SU-AI.ARPA, TOB@SU-AI.ARPA,
Reynolds@SU-SCORE.ARPA, Nilsson@SU-SCORE.ARPA, Scott@SU-SCORE.ARPA
The Search Committee will meet with Jean-Claude Latombe for Lunch at the
Faculty Club on Tuesday, July 9 @ 12:00 pm.
Please let me know if you will definitely be there.
Thanks.
karen
-------
∂27-Jun-85 1701 RA check
Royalties check for you from MIT on your desk.
∂28-Jun-85 0830 KUO IJCAI-85
To: JMC
CC: KUO
Dear Prof.McCarthy:
The Ninth International Joint Conference on Artificial Intelligence is coming
to California soon. I still clearly remember how I lost the chance to attend the
Eighth Conference in West Germany, therefore I earnest hope I would be able to
attend this conference before I leave California. I am wondering if you could
help me to find financial assistance for my attendance of this conference since
my payment from CSLI stopped in last April. A rough estimate of the expense is
the following:
registration fee $225
accommondation $250 (Residence Halls on UCLA Campus)
travelling expense $100 (approximately)
Any help from you will be greatly appreciated!
---- Victor
∂28-Jun-85 1704 JF@SU-SUSHI.ARPA July Coffee Money due
Received: from SU-SUSHI.ARPA by SU-AI.ARPA with TCP; 28 Jun 85 17:04:40 PDT
Date: Fri 28 Jun 85 17:02:59-PDT
From: Joan Feigenbaum <JF@SU-SUSHI.ARPA>
Subject: July Coffee Money due
To: coffee-drinkers: ;
Please give July coffeepool dues to me as soon as you have a chance.
Thanks
Joan Feigenbaum
(MJH 325, 4971787)
-------
∂30-Jun-85 1153 JMC
Chudnovsky factorization success
3↑124+1
17 sec on 3081 vs. 1.5 hours on Cray at Sandia
∂30-Jun-85 1913 @seismo.ARPA:munnari!mulga.oz!jwl@seismo
Received: from SEISMO.ARPA by SU-AI.ARPA with TCP; 30 Jun 85 19:13:00 PDT
Return-Path: <munnari!mulga.oz!jwl@seismo>
Received: from munnari.OZ by seismo.ARPA with UUCP; Sun, 30 Jun 85 22:13:16 EDT
Received: from mulga.OZ (mulga) by munnari with SMTP (4.44)
id AA07319; Mon, 1 Jul 85 12:07:13 EST
Received: by mulga (4.44)
id AA18824; Mon, 1 Jul 85 12:06:26 EST
Date: Mon, 1 Jul 85 12:06:26 EST
From: munnari!mulga.oz!jwl@seismo (John Lloyd)
Message-Id: <8507010206.18824@mulga.OZ>
To: jmc@su-ai.arpa
Thank you for your reply to my mail.
I have in fact arranged to give a seminar at IBM San Jose on the Monday
22nd at 2pm, hoping that the Tuesday would be ok for you. This doesnt
leave much time on Monday morning - certainly not enough for a seminar.
I'm sorry that I couldn't give you more options, but you know how
it is when you are just passing through!
It might be possible for me to visit Stanford for a couple of hours first
thing on the Monday morning, provided there was some way to get down to
San Jose afterwards (I wont have a car). The only other
thing I can suggest is that you contact Peter Lucas and see if it
would be possible to change my Monday seminar to the Tuesday.
At the moment, I'm free all day on the Tuesday and it doesn't bother me
which way the visits are arranged. I'm flying back to Melbourne at 9pm
on the Tuesday evening.
John Lloyd